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 listMay 11, 2026 15:14Chang Jia JunChang Jia JunScore: 65,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:1465,041550,710,158538,845,0001,003,0002,113,536
2May 11, 2026 15:1465,042549,504,912538,848,0001,003,0002,113,536
3May 11, 2026 15:1465,052549,217,440538,936,0001,003,0002,113,536
4May 11, 2026 15:1465,090552,814,105539,250,0001,001,0002,113,536
5May 11, 2026 15:1465,093549,114,286539,272,0001,003,0002,113,536
6May 11, 2026 15:1465,100551,062,481539,328,0001,002,0002,113,536
7May 11, 2026 15:1465,139551,284,116539,659,0001,002,0002,113,536
8May 11, 2026 15:1465,165550,173,297539,874,0001,002,0002,113,536
9May 11, 2026 15:1465,223550,130,798540,355,0001,003,0002,113,536