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 23:43Victor MerckléVictor MerckléScore: 3,843Success
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 23:443,73139,378,78429,866,0001,106,0002,117,632stderr
2Aug 12, 2026 23:443,74839,465,82430,013,0001,102,0002,117,632stderr
3Aug 12, 2026 23:443,75940,286,04930,101,0001,102,0002,117,632stderr
4Aug 12, 2026 23:443,77339,734,46230,212,0001,110,0002,117,632stderr
5Aug 12, 2026 23:443,84340,190,84530,644,0001,254,0002,117,632stderr
6Aug 12, 2026 23:443,93841,096,58931,600,0001,092,0002,117,632stderr
7Aug 12, 2026 23:443,94541,171,31331,673,0001,077,0002,117,632stderr
8Aug 12, 2026 23:443,99641,564,62232,120,0001,055,0002,117,632stderr
9Aug 12, 2026 23:444,09342,378,48232,873,0001,103,0002,117,632stderr