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 27, 2026 11:34Victor MerckléVictor MerckléScore: 3,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 11:353,76539,550,73430,093,0001,164,0002,113,536
2Aug 27, 2026 11:353,78039,723,78930,241,0001,140,0002,113,536
3Aug 27, 2026 11:353,78139,574,74230,286,0001,102,0002,113,536
4Aug 27, 2026 11:353,79339,829,57030,444,0001,041,0002,113,536
5Aug 27, 2026 11:353,80339,940,11530,485,0001,083,0002,113,536
6Aug 27, 2026 11:353,81639,856,98330,534,0001,141,0002,113,536
7Aug 27, 2026 11:353,86840,954,70531,046,0001,059,0002,113,536
8Aug 27, 2026 11:353,89441,427,14231,167,0001,158,0002,113,536
9Aug 27, 2026 11:353,93440,985,72831,568,0001,085,0002,113,536