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 listJul 3, 2026 20:57Josu San MartinJosu San MartinScore: 8,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:578,43479,373,39563,268,0006,737,0002,121,728
2Jul 3, 2026 20:578,45679,588,18063,436,0006,757,0002,121,728
3Jul 3, 2026 20:578,46079,538,43763,484,0006,740,0002,121,728
4Jul 3, 2026 20:578,46179,636,66563,454,0006,779,0002,121,728
5Jul 3, 2026 20:578,49279,866,49763,627,0006,862,0002,117,632
6Jul 3, 2026 20:578,49779,927,96763,569,0006,959,0002,121,728
7Jul 3, 2026 20:578,51479,963,85263,901,0006,770,0002,117,632
8Jul 3, 2026 20:578,52480,113,97463,904,0006,853,0002,117,632
9Jul 3, 2026 20:578,55880,371,84964,034,0006,999,0002,117,632