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 18:26Victor MerckléVictor MerckléScore: 3,946Success
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 18:433,87240,675,15331,112,0001,030,0002,117,632stderr
2Sep 8, 2026 18:433,93641,891,21631,619,0001,050,0002,117,632stderr
3Sep 8, 2026 18:433,94241,230,77631,677,0001,044,0002,117,632stderr
4Sep 8, 2026 18:433,94441,992,90831,693,0001,044,0002,117,632stderr
5Sep 8, 2026 18:433,94641,968,72431,714,0001,044,0002,117,632stderr
6Sep 8, 2026 18:433,95341,379,70931,784,0001,031,0002,117,632stderr
7Sep 8, 2026 18:433,95542,164,53631,809,0001,024,0002,117,632stderr
8Sep 8, 2026 18:433,95742,113,27631,839,0001,006,0002,117,632stderr
9Sep 8, 2026 18:433,96541,222,13531,844,0001,068,0002,117,632stderr