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 30, 2026 17:38boop34boop34Score: 8,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 17:388,94384,192,31173,023,0001,208,0002,113,536
2Jul 30, 2026 17:388,96184,273,69173,266,0001,116,0002,113,536
3Jul 30, 2026 17:388,96584,403,43973,290,0001,124,0002,113,536
4Jul 30, 2026 17:388,96884,323,75273,208,0001,231,0002,113,536
5Jul 30, 2026 17:388,97084,309,23573,317,0001,139,0002,113,536
6Jul 30, 2026 17:388,97084,366,40773,339,0001,118,0002,113,536
7Jul 30, 2026 17:388,97284,345,48573,353,0001,120,0002,113,536
8Jul 30, 2026 17:388,98984,574,43473,487,0001,129,0002,113,536
9Jul 30, 2026 17:389,14687,708,50574,717,0001,199,0002,113,536