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 10, 2026 16:37Victor MerckléVictor MerckléScore: 4,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 16:394,08342,049,65832,790,0001,105,0002,117,632stderr
2Aug 10, 2026 16:394,08442,166,80432,895,0001,008,0002,117,632stderr
3Aug 10, 2026 16:394,09842,239,29132,917,0001,097,0002,117,632stderr
4Aug 10, 2026 16:394,10042,318,82932,906,0001,124,0002,117,632stderr
5Aug 10, 2026 16:394,10142,776,61032,988,0001,056,0002,117,632stderr
6Aug 10, 2026 16:394,11242,351,52333,124,0001,011,0002,117,632stderr
7Aug 10, 2026 16:394,12043,888,25933,078,0001,126,0002,117,632stderr
8Aug 10, 2026 16:394,13542,597,95233,210,0001,118,0002,117,632stderr
9Aug 10, 2026 16:394,19243,270,22733,684,0001,111,0002,117,632stderr