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 03:42M-RochatM-RochatScore: 78,918Success
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 03:4578,883664,516,643651,483,0003,246,0002,138,112
2May 20, 2026 03:4578,908665,835,714651,693,0003,244,0002,138,112
3May 20, 2026 03:4578,910665,819,491651,952,0003,004,0002,138,112
4May 20, 2026 03:4578,913665,959,132651,974,0003,006,0002,138,112
5May 20, 2026 03:4578,918665,738,174651,952,0003,075,0002,138,112
6May 20, 2026 03:4578,918665,801,231651,955,0003,072,0002,138,112
7May 20, 2026 03:4578,922665,592,260651,796,0003,257,0002,138,112
8May 20, 2026 03:4578,926665,547,872651,885,0003,204,0002,138,112
9May 20, 2026 03:4578,938666,280,119651,952,0003,238,0002,138,112