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 14, 2026 07:51Victor MerckléVictor MerckléScore: 59,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 07:5159,975505,986,249496,799,0001,001,0002,117,632stderr
2May 14, 2026 07:5159,981507,561,057496,842,0001,005,0002,117,632stderr
3May 14, 2026 07:5159,983505,253,036496,857,0001,002,0002,117,632stderr
4May 14, 2026 07:5159,983504,948,356496,860,0001,001,0002,117,632stderr
5May 14, 2026 07:5159,983505,195,446496,866,0001,001,0002,117,632stderr
6May 14, 2026 07:5159,984508,020,550496,870,0001,003,0002,117,632stderr
7May 14, 2026 07:5159,987507,219,965496,899,0001,001,0002,117,632stderr
8May 14, 2026 07:5159,994508,152,107496,953,0001,003,0002,117,632stderr
9May 14, 2026 07:5160,004505,344,983497,039,0001,001,0002,117,632stderr