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 18:30Victor MerckléVictor MerckléScore: 3,942Success
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 18:313,89640,645,08131,147,0001,196,0002,117,632stderr
2Aug 10, 2026 18:313,91740,894,28831,325,0001,187,0002,117,632stderr
3Aug 10, 2026 18:313,92640,777,10631,465,0001,127,0002,117,632stderr
4Aug 10, 2026 18:313,93640,855,01931,461,0001,208,0002,117,632stderr
5Aug 10, 2026 18:313,94241,095,83231,540,0001,181,0002,117,632stderr
6Aug 10, 2026 18:313,94340,901,84331,607,0001,126,0002,117,632stderr
7Aug 10, 2026 18:313,95741,259,21231,639,0001,210,0002,117,632stderr
8Aug 10, 2026 18:313,95741,202,41531,656,0001,195,0002,117,632stderr
9Aug 10, 2026 18:313,96141,180,17831,677,0001,203,0002,117,632stderr