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 22, 2026 08:48Victor MerckléVictor MerckléScore: 4,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 08:494,56145,680,10836,810,0001,052,0002,113,536
2May 22, 2026 08:494,56851,753,10136,833,0001,083,0002,113,536
3May 22, 2026 08:494,57747,032,15436,922,0001,072,0002,113,536
4May 22, 2026 08:494,58145,856,01837,025,0001,001,0002,113,536
5May 22, 2026 08:494,58245,866,47537,029,0001,007,0002,113,536
6May 22, 2026 08:494,59045,930,52337,061,0001,036,0002,113,536
7May 22, 2026 08:494,59447,634,62037,073,0001,061,0002,113,536
8May 22, 2026 08:494,59746,014,62537,131,0001,029,0002,113,536
9May 22, 2026 08:494,60046,030,73137,172,0001,010,0002,113,536