Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listApr 2, 2026 19:48leoweleoweScore: 68,166Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2026 19:4868,114590,491,174500,421,00064,924,0002,281,472
2Apr 2, 2026 19:4868,166588,357,515502,800,00062,974,0002,269,184
3Apr 2, 2026 19:4868,197592,551,032503,031,00063,003,0002,265,088