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 23, 2026 19:56Victor MerckléVictor MerckléScore: 3,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:573,72539,927,76329,809,0001,109,0002,117,632stderr
2Aug 23, 2026 19:573,75540,229,48830,036,0001,133,0002,117,632stderr
3Aug 23, 2026 19:573,77240,341,72930,186,0001,124,0002,117,632stderr
4Aug 23, 2026 19:573,78840,507,68730,292,0001,151,0002,117,632stderr
5Aug 23, 2026 19:573,79041,010,20730,366,0001,096,0002,117,632stderr
6Aug 23, 2026 19:573,79340,197,97330,362,0001,120,0002,117,632stderr
7Aug 23, 2026 19:573,80640,774,07430,494,0001,097,0002,117,632stderr
8Aug 23, 2026 19:573,80840,000,69030,451,0001,162,0002,117,632stderr
9Aug 23, 2026 19:573,91140,806,65231,398,0001,070,0002,117,632stderr