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 15, 2026 18:37boop34boop34Score: 8,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 18:378,94785,179,35573,248,0001,020,0002,113,536
2Jul 15, 2026 18:378,95883,889,73773,348,0001,006,0002,113,536
3Jul 15, 2026 18:378,96184,019,04573,376,0001,008,0002,113,536
4Jul 15, 2026 18:378,96584,105,49673,390,0001,024,0002,113,536
5Jul 15, 2026 18:378,96984,022,49473,440,0001,006,0002,113,536
6Jul 15, 2026 18:378,99284,270,07773,436,0001,203,0002,113,536
7Jul 15, 2026 18:379,00084,305,79173,701,0001,006,0002,113,536
8Jul 15, 2026 18:379,01084,346,16273,778,0001,013,0002,113,536
9Jul 15, 2026 18:379,02584,583,54473,902,0001,006,0002,113,536