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 22, 2026 23:59M-RochatM-RochatScore: 6,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:596,56764,920,10153,498,0001,016,0002,113,536
2May 22, 2026 23:596,58563,851,54253,642,0001,019,0002,113,536
3May 22, 2026 23:596,62666,930,65053,987,0001,015,0002,113,536
4May 22, 2026 23:596,65065,537,72154,161,0001,038,0002,113,536
5May 22, 2026 23:596,66265,711,55154,278,0001,018,0002,113,536
6May 22, 2026 23:596,67366,511,31554,375,0001,017,0002,113,536
7May 22, 2026 23:596,68166,654,60954,439,0001,017,0002,113,536
8May 22, 2026 23:596,69165,541,68254,526,0001,017,0002,113,536
9May 22, 2026 23:596,71966,965,23154,752,0001,017,0002,113,536