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 18:48Victor MerckléVictor MerckléScore: 4,020Success
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 18:493,99742,973,97632,136,0001,044,0002,117,632stderr
2Sep 16, 2026 18:494,00343,059,91332,193,0001,036,0002,117,632stderr
3Sep 16, 2026 18:494,00542,862,31632,194,0001,051,0002,117,632stderr
4Sep 16, 2026 18:494,01344,398,61232,257,0001,052,0002,117,632stderr
5Sep 16, 2026 18:494,02043,217,72632,320,0001,050,0002,117,632stderr
6Sep 16, 2026 18:494,02743,879,51032,413,0001,013,0002,117,632stderr
7Sep 16, 2026 18:494,08243,686,74332,843,0001,044,0002,117,632stderr
8Sep 16, 2026 18:494,09143,935,41032,906,0001,056,0002,117,632stderr
9Sep 16, 2026 18:494,13544,124,93733,284,0001,038,0002,117,632stderr