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 23, 2026 00:08M-RochatM-RochatScore: 6,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 00:086,49763,368,04952,913,0001,016,0002,113,536
2May 23, 2026 00:086,51063,225,52953,018,0001,016,0002,113,536
3May 23, 2026 00:086,52465,402,72753,134,0001,016,0002,113,536
4May 23, 2026 00:086,52666,256,41553,151,0001,016,0002,113,536
5May 23, 2026 00:086,57865,586,58853,585,0001,018,0002,113,536
6May 23, 2026 00:086,60765,702,62453,823,0001,017,0002,113,536
7May 23, 2026 00:086,62366,959,70653,960,0001,017,0002,113,536
8May 23, 2026 00:086,62865,676,43454,002,0001,018,0002,113,536
9May 23, 2026 00:086,66966,423,40954,338,0001,018,0002,113,536