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 05:49M-RochatM-RochatScore: 12,487Success
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 05:4912,450112,698,045101,007,0002,336,0002,113,536
2May 20, 2026 05:4912,461113,368,707101,083,0002,344,0002,113,536
3May 20, 2026 05:4912,481115,015,448101,557,0002,037,0002,113,536
4May 20, 2026 05:4912,483115,472,429101,283,0002,334,0002,113,536
5May 20, 2026 05:4912,487113,129,756101,319,0002,330,0002,113,536
6May 20, 2026 05:4912,501115,095,572101,719,0002,040,0002,113,536
7May 20, 2026 05:4912,549114,760,723102,103,0002,058,0002,113,536
8May 20, 2026 05:4912,559115,815,306102,187,0002,060,0002,113,536
9May 20, 2026 05:4912,598118,920,447102,474,0002,091,0002,113,536