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 22, 2026 23:56M-RochatM-RochatScore: 6,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:566,57565,746,15353,561,0001,015,0002,113,536
2May 22, 2026 23:566,57963,865,69753,594,0001,017,0002,113,536
3May 22, 2026 23:566,58864,881,49053,672,0001,015,0002,113,536
4May 22, 2026 23:566,61964,097,23653,929,0001,015,0002,113,536
5May 22, 2026 23:566,62066,897,08753,933,0001,016,0002,113,536
6May 22, 2026 23:566,62564,640,74353,974,0001,015,0002,113,536
7May 22, 2026 23:566,63165,499,45154,025,0001,015,0002,113,536
8May 22, 2026 23:566,63264,434,51354,031,0001,017,0002,113,536
9May 22, 2026 23:566,68566,602,61854,471,0001,017,0002,113,536