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 listFeb 15, 2026 23:20wnwnScore: 8,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:207,25384,095,67152,171,0008,026,0002,314,240
2Feb 15, 2026 23:207,46683,360,75052,975,0008,995,0002,502,656
3Feb 15, 2026 23:207,51995,605,58352,339,00010,065,0002,273,280
4Feb 15, 2026 23:208,44489,754,21961,077,0009,011,0002,297,856
5Feb 15, 2026 23:208,55093,596,66863,966,0006,996,0002,473,984
6Feb 15, 2026 23:208,93496,485,50766,135,0008,016,0002,281,472