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 listMay 21, 2026 15:01Victor MerckléVictor MerckléScore: 4,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 15:024,57746,179,47436,928,0001,067,0002,113,536
2May 21, 2026 15:024,58045,933,79936,959,0001,063,0002,113,536
3May 21, 2026 15:024,60046,108,44637,180,0001,004,0002,113,536
4May 21, 2026 15:024,61046,173,21037,187,0001,081,0002,113,536
5May 21, 2026 15:024,61146,132,01737,216,0001,062,0002,113,536
6May 21, 2026 15:024,64146,458,84937,518,0001,005,0002,113,536
7May 21, 2026 15:024,64946,519,68537,584,0001,003,0002,113,536
8May 21, 2026 15:024,80947,756,43838,850,0001,070,0002,113,536
9May 21, 2026 15:024,83348,048,95539,064,0001,057,0002,113,536