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 19, 2026 12:59Victor MerckléVictor MerckléScore: 6,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 13:016,09858,411,33049,585,0001,033,0002,113,536
2May 19, 2026 13:016,09959,143,64149,597,0001,025,0002,113,536
3May 19, 2026 13:016,10058,641,69549,626,0001,004,0002,113,536
4May 19, 2026 13:016,10660,075,53049,658,0001,023,0002,113,536
5May 19, 2026 13:016,21859,370,69250,592,0001,021,0002,113,536
6May 19, 2026 13:016,23659,491,06550,743,0001,020,0002,113,536
7May 19, 2026 13:016,24159,540,56550,786,0001,018,0002,113,536
8May 19, 2026 13:016,29360,349,58251,230,0001,003,0002,113,536
9May 19, 2026 13:016,33960,446,10251,615,0001,005,0002,113,536