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 03:52Victor MerckléVictor MerckléScore: 4,091Success
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 03:534,05242,101,97932,470,0001,165,0002,117,632stderr
2Aug 12, 2026 03:534,07042,172,60932,718,0001,070,0002,117,632stderr
3Aug 12, 2026 03:534,07943,378,00732,778,0001,078,0002,117,632stderr
4Aug 12, 2026 03:534,08642,311,42432,776,0001,141,0002,117,632stderr
5Aug 12, 2026 03:534,09142,362,65832,889,0001,072,0002,117,632stderr
6Aug 12, 2026 03:534,09542,449,82832,834,0001,162,0002,117,632stderr
7Aug 12, 2026 03:534,09742,413,64832,853,0001,158,0002,117,632stderr
8Aug 12, 2026 03:534,12544,432,45933,083,0001,155,0002,117,632stderr
9Aug 12, 2026 03:534,43545,241,40535,628,0001,183,0002,117,632stderr