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 listSep 16, 2026 16:33Victor MerckléVictor MerckléScore: 40,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 16:4239,992342,407,275330,921,0001,016,0002,117,632stderr
2Sep 16, 2026 16:4240,030342,048,972331,061,0001,191,0002,117,632stderr
3Sep 16, 2026 16:4240,077343,248,918331,640,0001,002,0002,117,632stderr
4Sep 16, 2026 16:4240,087343,197,637331,570,0001,155,0002,117,632stderr
5Sep 16, 2026 16:4240,104342,706,222331,714,0001,154,0002,117,632stderr
6Sep 16, 2026 16:4240,112343,466,598331,796,0001,138,0002,117,632stderr
7Sep 16, 2026 16:4240,130343,531,939331,924,0001,155,0002,117,632stderr
8Sep 16, 2026 16:4240,195345,782,263332,618,0001,004,0002,117,632stderr
9Sep 16, 2026 16:4240,236344,435,961332,945,0001,018,0002,117,632stderr