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 05:53M-RochatM-RochatScore: 12,220Success
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 05:5412,179110,469,627100,081,0001,009,0002,113,536
2May 20, 2026 05:5412,190112,133,78999,907,0001,270,0002,113,536
3May 20, 2026 05:5412,202110,737,660100,270,0001,009,0002,113,536
4May 20, 2026 05:5412,215111,692,253100,121,0001,268,0002,113,536
5May 20, 2026 05:5412,220111,832,942100,420,0001,010,0002,113,536
6May 20, 2026 05:5412,250111,083,45899,660,0002,015,0002,113,536
7May 20, 2026 05:5412,279111,849,71199,880,0002,039,0002,113,536
8May 20, 2026 05:5412,292111,754,607100,021,0002,004,0002,113,536
9May 20, 2026 05:5412,353112,989,542100,499,0002,037,0002,113,536