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 06:42M-RochatM-RochatScore: 78,596Success
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 06:4278,519664,104,159650,710,0001,002,0002,113,536
2May 20, 2026 06:4278,543661,247,895650,911,0001,002,0002,113,536
3May 20, 2026 06:4278,545664,013,560650,926,0001,001,0002,113,536
4May 20, 2026 06:4278,590661,690,474651,298,0001,001,0002,113,536
5May 20, 2026 06:4278,596663,611,572651,347,0001,001,0002,113,536
6May 20, 2026 06:4278,606664,300,508651,433,0001,003,0002,113,536
7May 20, 2026 06:4278,622662,849,990651,561,0001,003,0002,113,536
8May 20, 2026 06:4278,642662,660,293651,729,0001,001,0002,113,536
9May 20, 2026 06:4278,658662,675,090651,863,0001,002,0002,113,536