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 3, 2026 18:36Josu San MartinJosu San MartinScore: 10,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 18:3710,10993,274,45278,712,0005,197,0002,113,536
2Jul 3, 2026 18:3710,11093,254,49978,643,0005,271,0002,113,536
3Jul 3, 2026 18:3710,12393,374,28478,793,0005,230,0002,113,536
4Jul 3, 2026 18:3710,15093,615,33178,780,0005,468,0002,113,536
5Jul 3, 2026 18:3710,21394,807,07179,529,0005,247,0002,113,536
6Jul 3, 2026 18:3710,21494,046,37279,483,0005,297,0002,113,536
7Jul 3, 2026 18:3710,23394,292,34979,617,0005,320,0002,113,536
8Jul 3, 2026 18:3710,27294,569,39879,961,0005,302,0002,113,536
9Jul 3, 2026 18:3710,27294,622,35280,102,0005,158,0002,113,536