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 10:13wnwnScore: 7,243Success
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 10:136,26874,997,41950,024,0002,000,0002,428,928
2Feb 18, 2026 10:136,29177,710,44948,200,0004,016,0002,482,176
3Feb 18, 2026 10:136,29676,745,86350,249,0002,009,0002,494,464
4Feb 18, 2026 10:137,24380,813,26157,112,0003,005,0002,514,944
5Feb 18, 2026 10:137,36189,220,33258,094,0003,004,0002,473,984
6Feb 18, 2026 10:137,37286,500,49958,175,0003,009,0002,502,656