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 00:37Victor MerckléVictor MerckléScore: 7,318Success
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 00:387,23368,493,25958,873,0001,164,0002,117,632stderr
2Aug 25, 2026 00:387,24668,747,53459,000,0001,143,0002,117,632stderr
3Aug 25, 2026 00:387,26668,693,06559,199,0001,113,0002,117,632stderr
4Aug 25, 2026 00:387,28468,838,94359,376,0001,084,0002,117,632stderr
5Aug 25, 2026 00:387,31869,116,72759,727,0001,014,0002,117,632stderr
6Aug 25, 2026 00:387,34369,351,59359,853,0001,094,0002,117,632stderr
7Aug 25, 2026 00:387,42870,082,17660,552,0001,106,0002,117,632stderr
8Aug 25, 2026 00:387,49170,539,23861,083,0001,099,0002,117,632stderr
9Aug 25, 2026 00:387,56971,254,68861,709,0001,121,0002,117,632stderr