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 17, 2026 21:22zielajzielajScore: 3,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 21:223,34935,529,19226,770,0001,034,0002,113,536
2May 17, 2026 21:223,36535,725,71426,903,0001,033,0002,113,536
3May 17, 2026 21:223,37937,614,76127,028,0001,023,0002,113,536
4May 17, 2026 21:223,46038,106,68527,701,0001,025,0002,113,536
5May 17, 2026 21:223,48437,284,53827,893,0001,026,0002,113,536
6May 17, 2026 21:223,49236,893,30627,908,0001,083,0002,113,536
7May 17, 2026 21:223,51537,092,96328,137,0001,044,0002,113,536
8May 17, 2026 21:223,53338,037,10828,259,0001,067,0002,113,536
9May 17, 2026 21:223,53839,992,94228,340,0001,028,0002,113,536