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 listAug 31, 2026 13:37Victor MerckléVictor MerckléScore: 56,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 13:4056,744480,796,465469,978,0001,003,0002,117,632stderr
2Aug 31, 2026 13:4056,749480,792,222470,018,0001,004,0002,117,632stderr
3Aug 31, 2026 13:4056,757481,005,730470,086,0001,005,0002,117,632stderr
4Aug 31, 2026 13:4056,760481,089,617470,108,0001,005,0002,117,632stderr
5Aug 31, 2026 13:4056,764480,993,896470,145,0001,003,0002,117,632stderr
6Aug 31, 2026 13:4056,765481,066,009470,152,0001,003,0002,117,632stderr
7Aug 31, 2026 13:4056,777481,133,821470,251,0001,004,0002,117,632stderr
8Aug 31, 2026 13:4056,779481,081,332470,265,0001,005,0002,117,632stderr
9Aug 31, 2026 13:4056,783481,168,626470,301,0001,003,0002,117,632stderr