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 listAug 6, 2026 20:31TonyTonyScore: 7,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 20:317,80374,790,61562,005,0002,764,0002,113,536
2Aug 6, 2026 20:317,81074,828,21462,059,0002,764,0002,113,536
3Aug 6, 2026 20:317,83175,037,58962,270,0002,733,0002,113,536
4Aug 6, 2026 20:317,83875,013,71662,342,0002,714,0002,113,536
5Aug 6, 2026 20:317,84175,013,03763,045,0002,043,0002,113,536
6Aug 6, 2026 20:317,84475,095,01862,445,0002,661,0002,113,536
7Aug 6, 2026 20:317,88075,418,84063,378,0002,028,0002,113,536
8Aug 6, 2026 20:317,88775,522,27663,372,0002,092,0002,113,536
9Aug 6, 2026 20:317,89775,898,28363,448,0002,105,0002,113,536