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 22, 2026 05:54Kevin HeaveyKevin HeaveyScore: 77,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 06:0176,421644,171,044630,230,0004,068,0002,117,632
2Jul 22, 2026 06:0176,488649,963,893631,848,0003,009,0002,117,632
3Jul 22, 2026 06:0176,757647,057,535633,247,0003,842,0002,117,632
4Jul 22, 2026 06:0177,137650,088,378637,199,0003,046,0002,117,632
5Jul 22, 2026 06:0177,348651,993,060637,796,0004,197,0002,117,632
6Jul 22, 2026 06:0178,361660,362,895647,389,0003,008,0002,117,632
7Jul 22, 2026 06:0178,383660,543,789647,572,0003,007,0002,117,632
8Jul 22, 2026 06:0178,413664,833,452647,699,0003,132,0002,117,632
9Jul 22, 2026 06:0179,254672,959,015653,691,0004,124,0002,117,632