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 18, 2026 14:23wnwnScore: 3,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 14:233,30636,275,41226,359,0001,084,0002,113,536
2May 18, 2026 14:233,32135,916,89126,568,0001,003,0002,113,536
3May 18, 2026 14:233,33737,595,70826,672,0001,032,0002,113,536
4May 18, 2026 14:233,41037,331,35427,301,0001,009,0002,113,536
5May 18, 2026 14:233,42336,577,13127,396,0001,022,0002,113,536
6May 18, 2026 14:233,42737,104,96327,421,0001,030,0002,113,536
7May 18, 2026 14:233,42836,420,02527,450,0001,008,0002,113,536
8May 18, 2026 14:233,44937,316,50627,590,0001,037,0002,113,536
9May 18, 2026 14:233,46839,242,73127,758,0001,031,0002,113,536