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 5, 2026 12:51Kevin HeaveyKevin HeaveyScore: 21,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:5221,101184,664,822174,137,0001,008,0002,117,632
2Jul 5, 2026 12:5221,103184,735,953174,151,0001,007,0002,117,632
3Jul 5, 2026 12:5221,712189,663,758179,201,0001,009,0002,117,632
4Jul 5, 2026 12:5221,719189,839,847179,261,0001,008,0002,117,632
5Jul 5, 2026 12:5221,723189,840,349179,296,0001,007,0002,117,632
6Jul 5, 2026 12:5221,729189,912,124179,349,0001,007,0002,117,632
7Jul 5, 2026 12:5221,736189,946,679179,400,0001,009,0002,117,632
8Jul 5, 2026 12:5221,739189,949,992179,430,0001,009,0002,117,632
9Jul 5, 2026 12:5221,742191,358,328179,456,0001,006,0002,117,632