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 28, 2026 03:15Victor MerckléVictor MerckléScore: 4,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 03:164,15042,176,93433,450,0001,003,0002,113,536
2Jun 28, 2026 03:164,15842,524,87033,515,0001,003,0002,113,536
3Jun 28, 2026 03:164,16242,558,21433,434,0001,113,0002,113,536
4Jun 28, 2026 03:164,16242,285,97533,483,0001,066,0002,113,536
5Jun 28, 2026 03:164,16442,340,32533,472,0001,090,0002,113,536
6Jun 28, 2026 03:164,17542,486,12133,614,0001,039,0002,113,536
7Jun 28, 2026 03:164,27943,264,17034,458,0001,059,0002,113,536
8Jun 28, 2026 03:164,31045,742,28434,750,0001,023,0002,113,536
9Jun 28, 2026 03:164,31143,443,49234,758,0001,028,0002,113,536