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 17, 2026 03:07Victor MerckléVictor MerckléScore: 28,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 03:0928,540246,779,041235,882,0001,002,0002,117,632stderr
2Sep 17, 2026 03:0928,546246,949,373235,805,0001,135,0002,117,632stderr
3Sep 17, 2026 03:0928,650248,438,355236,778,0001,023,0002,117,632stderr
4Sep 17, 2026 03:0928,684248,185,020237,048,0001,036,0002,117,632stderr
5Sep 17, 2026 03:0928,703248,242,143237,183,0001,055,0002,117,632stderr
6Sep 17, 2026 03:0928,716248,873,808237,234,0001,113,0002,117,632stderr
7Sep 17, 2026 03:0928,723248,327,524237,280,0001,124,0002,117,632stderr
8Sep 17, 2026 03:0928,730248,331,836237,354,0001,108,0002,117,632stderr
9Sep 17, 2026 03:0928,768249,178,121237,639,0001,137,0002,117,632stderr