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 20:01boop34boop34Score: 8,653Success
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 20:028,60481,379,71570,274,0001,143,0002,113,536
2Jul 30, 2026 20:028,62981,503,61570,393,0001,229,0002,113,536
3Jul 30, 2026 20:028,64281,630,20070,527,0001,209,0002,113,536
4Jul 30, 2026 20:028,65081,635,93270,665,0001,131,0002,113,536
5Jul 30, 2026 20:028,65381,711,55270,625,0001,199,0002,113,536
6Jul 30, 2026 20:028,65981,835,47070,742,0001,130,0002,113,536
7Jul 30, 2026 20:028,66081,786,21670,648,0001,233,0002,113,536
8Jul 30, 2026 20:028,66781,827,35470,826,0001,118,0002,113,536
9Jul 30, 2026 20:028,68481,992,94970,885,0001,200,0002,113,536