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 listJun 11, 2026 01:27Victor MerckléVictor MerckléScore: 23,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 01:2723,032198,679,228190,151,0001,021,0002,113,536
2Jun 11, 2026 01:2723,048198,932,732190,203,0001,101,0002,113,536
3Jun 11, 2026 01:2723,051198,864,859190,247,0001,079,0002,113,536
4Jun 11, 2026 01:2723,051198,755,152190,271,0001,058,0002,113,536
5Jun 11, 2026 01:2723,056198,928,326190,246,0001,122,0002,113,536
6Jun 11, 2026 01:2723,059199,047,444190,326,0001,066,0002,113,536
7Jun 11, 2026 01:2723,063198,865,960190,336,0001,090,0002,113,536
8Jun 11, 2026 01:2723,067198,884,593190,397,0001,060,0002,113,536
9Jun 11, 2026 01:2723,089199,271,292190,598,0001,042,0002,113,536