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 8, 2026 09:39Victor MerckléVictor MerckléScore: 3,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 09:433,74839,603,48830,097,0001,018,0002,117,632stderr
2Sep 8, 2026 09:433,76039,693,59630,172,0001,039,0002,117,632stderr
3Sep 8, 2026 09:433,76540,428,68930,136,0001,114,0002,117,632stderr
4Sep 8, 2026 09:433,76939,864,38930,274,0001,015,0002,117,632stderr
5Sep 8, 2026 09:433,78440,029,59030,394,0001,018,0002,117,632stderr
6Sep 8, 2026 09:433,79740,658,14430,402,0001,121,0002,117,632stderr
7Sep 8, 2026 09:433,80741,417,22430,477,0001,124,0002,117,632stderr
8Sep 8, 2026 09:433,93741,221,27531,552,0001,131,0002,121,728stderr
9Sep 8, 2026 09:433,98947,911,19832,088,0001,027,0002,117,632stderr