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 6, 2026 03:07CheckHarryCheckHarryScore: 3,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:083,89242,153,86631,298,0001,008,0002,113,536
2Sep 6, 2026 03:083,90142,289,21831,373,0001,011,0002,113,536
3Sep 6, 2026 03:083,90742,443,49831,418,0001,011,0002,113,536
4Sep 6, 2026 03:083,94642,635,55731,745,0001,011,0002,113,536
5Sep 6, 2026 03:083,95542,679,71731,812,0001,021,0002,113,536
6Sep 6, 2026 03:083,98248,064,82732,012,0001,039,0002,113,536
7Sep 6, 2026 03:083,99443,084,29232,139,0001,018,0002,113,536
8Sep 6, 2026 03:084,01343,197,63232,295,0001,020,0002,113,536
9Sep 6, 2026 03:084,03943,419,46132,488,0001,041,0002,113,536