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 01:48Victor MerckléVictor MerckléScore: 7,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 01:496,97666,296,35656,772,0001,133,0002,117,632stderr
2Aug 25, 2026 01:497,00466,569,12657,041,0001,093,0002,117,632stderr
3Aug 25, 2026 01:497,02466,696,12557,151,0001,153,0002,117,632stderr
4Aug 25, 2026 01:497,02966,686,68357,253,0001,089,0002,117,632stderr
5Aug 25, 2026 01:497,04667,083,45157,345,0001,143,0002,117,632stderr
6Aug 25, 2026 01:497,04866,923,02857,357,0001,144,0002,117,632stderr
7Aug 25, 2026 01:497,06966,982,57657,579,0001,096,0002,117,632stderr
8Aug 25, 2026 01:497,06967,128,95557,523,0001,156,0002,117,632stderr
9Aug 25, 2026 01:497,13967,632,80658,157,0001,103,0002,117,632stderr