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 18, 2026 13:54wnwnScore: 7,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 13:546,22677,026,58850,662,0001,013,0002,523,136
2Feb 18, 2026 13:546,25276,125,79048,901,0002,993,0002,301,952
3Feb 18, 2026 13:546,34173,451,04049,598,0003,036,0002,510,848
4Feb 18, 2026 13:547,10188,850,99955,941,0002,996,0002,428,928
5Feb 18, 2026 13:547,25779,459,53459,231,0001,003,0002,449,408
6Feb 18, 2026 13:547,29388,758,86455,485,0005,044,0002,445,312