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 listApr 27, 2026 15:30Victor MerckléVictor MerckléScore: 261,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 15:31261,6602,194,540,0302,166,784,0004,997,0002,506,752stderr
2Apr 27, 2026 15:31261,6942,193,816,4942,170,069,0001,998,0002,326,528stderr
3Apr 27, 2026 15:31261,7122,193,571,2902,170,213,0001,999,0002,506,752stderr
4Apr 27, 2026 15:31261,7302,190,892,7062,171,361,000999,0002,514,944stderr
5Apr 27, 2026 15:31261,7332,191,128,8852,171,387,000999,0002,338,816stderr
6Apr 27, 2026 15:31261,7482,189,535,8682,170,517,0001,998,0002,506,752stderr
7Apr 27, 2026 15:31261,7672,190,151,8162,170,672,0001,998,0002,326,528stderr
8Apr 27, 2026 15:31261,7672,192,647,9132,170,675,0001,998,0002,326,528stderr
9Apr 27, 2026 15:31261,8132,189,764,2652,172,049,000999,0002,510,848stderr