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 29, 2026 22:33boop34boop34Score: 8,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 22:378,95984,315,68173,340,0001,023,0002,113,536
2Jul 29, 2026 22:378,96484,362,34173,383,0001,021,0002,113,536
3Jul 29, 2026 22:378,97284,443,51473,450,0001,023,0002,113,536
4Jul 29, 2026 22:378,98684,527,76773,563,0001,024,0002,113,536
5Jul 29, 2026 22:378,99384,625,74073,621,0001,022,0002,113,536
6Jul 29, 2026 22:379,01584,828,80673,808,0001,021,0002,113,536
7Jul 29, 2026 22:379,09685,473,71174,474,0001,023,0002,113,536
8Jul 29, 2026 22:379,13685,805,61474,815,0001,021,0002,113,536
9Jul 29, 2026 22:379,23686,744,22275,641,0001,022,0002,113,536