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 12, 2026 01:34Victor MerckléVictor MerckléScore: 3,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 01:353,76939,707,09930,092,0001,191,0002,117,632stderr
2Aug 12, 2026 01:353,77139,680,38630,233,0001,071,0002,117,632stderr
3Aug 12, 2026 01:353,77439,724,03530,189,0001,141,0002,117,632stderr
4Aug 12, 2026 01:353,78339,745,69830,328,0001,075,0002,117,632stderr
5Aug 12, 2026 01:353,78939,834,34230,319,0001,137,0002,117,632stderr
6Aug 12, 2026 01:353,81640,106,48230,608,0001,072,0002,117,632stderr
7Aug 12, 2026 01:353,83740,255,49830,762,0001,090,0002,117,632stderr
8Aug 12, 2026 01:353,83740,223,80930,721,0001,130,0002,117,632stderr
9Aug 12, 2026 01:354,00341,613,74032,180,0001,050,0002,117,632stderr