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 26, 2026 23:26Victor MerckléVictor MerckléScore: 3,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:263,77840,385,41330,216,0001,148,0002,117,632stderr
2Aug 26, 2026 23:263,78539,817,62330,261,0001,159,0002,117,632stderr
3Aug 26, 2026 23:263,80039,927,98930,429,0001,118,0002,117,632stderr
4Aug 26, 2026 23:263,80141,506,17830,376,0001,177,0002,117,632stderr
5Aug 26, 2026 23:263,80440,700,60330,348,0001,227,0002,117,632stderr
6Aug 26, 2026 23:263,81240,028,92330,464,0001,182,0002,117,632stderr
7Aug 26, 2026 23:263,87149,907,64831,026,0001,110,0002,117,632stderr
8Aug 26, 2026 23:263,93550,768,56531,508,0001,160,0002,117,632stderr
9Aug 26, 2026 23:263,99641,531,15032,070,0001,104,0002,117,632stderr