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 listJul 31, 2026 10:46George SeabridgeGeorge SeabridgeScore: 52,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 10:4752,662447,120,194435,947,0001,155,0002,117,632
2Jul 31, 2026 10:4752,681447,357,187436,082,0001,178,0002,117,632
3Jul 31, 2026 10:4752,694447,334,738436,226,0001,139,0002,117,632
4Jul 31, 2026 10:4752,703447,424,440436,273,0001,166,0002,117,632
5Jul 31, 2026 10:4752,704447,436,887436,319,0001,132,0002,117,632
6Jul 31, 2026 10:4752,707447,505,268436,344,0001,131,0002,117,632
7Jul 31, 2026 10:4752,756447,945,012436,738,0001,145,0002,117,632
8Jul 31, 2026 10:4752,820448,387,234437,275,0001,139,0002,117,632
9Jul 31, 2026 10:4752,828448,409,514437,349,0001,124,0002,117,632