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 25, 2026 17:15Victor MerckléVictor MerckléScore: 12,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 17:1511,717106,221,53594,997,0002,259,0002,117,632stderr
2Aug 25, 2026 17:1511,940107,220,53696,934,0002,171,0002,117,632stderr
3Aug 25, 2026 17:1511,965107,564,96197,055,0002,261,0002,117,632stderr
4Aug 25, 2026 17:1512,040108,167,23397,677,0002,256,0002,117,632stderr
5Aug 25, 2026 17:1512,046108,192,29397,811,0002,177,0002,117,632stderr
6Aug 25, 2026 17:1512,425111,269,637100,933,0002,200,0002,117,632stderr
7Aug 25, 2026 17:1512,437111,538,858100,954,0002,276,0002,117,632stderr
8Aug 25, 2026 17:1512,464111,782,697101,248,0002,209,0002,117,632stderr
9Aug 25, 2026 17:1512,499111,863,305101,485,0002,261,0002,117,632stderr