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 13, 2026 17:39M-RochatM-RochatScore: 20,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:4019,894174,071,190164,087,0001,041,0002,113,536
2May 13, 2026 17:4019,911176,073,062164,241,0001,026,0002,113,536
3May 13, 2026 17:4020,030175,002,191165,191,0001,060,0002,113,536
4May 13, 2026 17:4020,076176,414,290165,602,0001,032,0002,113,536
5May 13, 2026 17:4020,101176,512,221165,676,0001,170,0002,113,536
6May 13, 2026 17:4020,215179,328,720166,758,0001,031,0002,113,536
7May 13, 2026 17:4020,238176,737,266166,969,0001,011,0002,113,536
8May 13, 2026 17:4020,239177,179,376166,963,0001,026,0002,113,536
9May 13, 2026 17:4020,263177,422,433167,167,0001,017,0002,113,536