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 16, 2026 02:44Victor MerckléVictor MerckléScore: 7,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 02:447,12568,170,08059,141,00002,113,536
2May 16, 2026 02:447,12566,463,91658,138,0001,007,0002,113,536
3May 16, 2026 02:447,12666,404,58159,148,00002,113,536
4May 16, 2026 02:447,12666,860,40158,141,0001,006,0002,113,536
5May 16, 2026 02:447,12766,992,80358,142,0001,013,0002,113,536
6May 16, 2026 02:447,12968,608,91959,175,00002,113,536
7May 16, 2026 02:447,13668,486,42958,214,0001,019,0002,113,536
8May 16, 2026 02:447,18668,052,39858,602,0001,042,0002,113,536
9May 16, 2026 02:447,50572,640,27161,270,0001,025,0002,113,536