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 listSep 17, 2026 01:25Andrew EpsteinAndrew EpsteinScore: 84,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 01:2584,003707,476,607690,534,0006,699,0002,117,632stderr
2Sep 17, 2026 01:2584,089708,382,687691,326,0006,614,0002,117,632stderr
3Sep 17, 2026 01:2584,161708,797,574691,501,0007,037,0002,117,632stderr
4Sep 17, 2026 01:2584,257710,252,172692,649,0006,691,0002,117,632stderr
5Sep 17, 2026 01:2584,303709,977,624693,071,0006,649,0002,117,632stderr
6Sep 17, 2026 01:2584,326710,115,765693,285,0006,629,0002,117,632stderr
7Sep 17, 2026 01:2584,392710,735,690693,729,0006,729,0002,117,632stderr
8Sep 17, 2026 01:2584,524711,856,134694,844,0006,712,0002,117,632stderr
9Sep 17, 2026 01:2584,555712,838,283695,094,0006,717,0002,117,632stderr