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 10:32Victor MerckléVictor MerckléScore: 3,767Success
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 10:333,71339,806,47829,686,0001,135,0002,117,632stderr
2Aug 25, 2026 10:333,73039,373,46629,831,0001,134,0002,117,632stderr
3Aug 25, 2026 10:333,73640,106,18729,902,0001,111,0002,117,632stderr
4Aug 25, 2026 10:333,74139,426,65129,962,0001,096,0002,117,632stderr
5Aug 25, 2026 10:333,76739,641,98330,060,0001,211,0002,117,632stderr
6Aug 25, 2026 10:333,77539,675,15630,235,0001,099,0002,117,632stderr
7Aug 25, 2026 10:333,79939,913,13330,455,0001,078,0002,117,632stderr
8Aug 25, 2026 10:333,81840,033,39130,621,0001,073,0002,117,632stderr
9Aug 25, 2026 10:333,83440,881,65530,703,0001,121,0002,117,632stderr