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 20, 2026 10:00M-RochatM-RochatScore: 11,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:0011,777109,189,70395,418,0002,333,0002,113,536
2May 20, 2026 10:0011,781107,179,51595,455,0002,330,0002,113,536
3May 20, 2026 10:0011,795110,379,75295,556,0002,350,0002,113,536
4May 20, 2026 10:0011,796108,270,25895,566,0002,344,0002,113,536
5May 20, 2026 10:0011,811109,323,70295,691,0002,342,0002,113,536
6May 20, 2026 10:0011,815108,159,42996,059,0002,011,0002,113,536
7May 20, 2026 10:0011,866109,384,31996,443,0002,046,0002,113,536
8May 20, 2026 10:0011,871109,762,10796,481,0002,050,0002,113,536
9May 20, 2026 10:0011,884110,471,90096,632,0002,010,0002,113,536