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 12:58Victor MerckléVictor MerckléScore: 3,810Success
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 12:583,71439,296,41829,684,0001,144,0002,113,536
2Aug 27, 2026 12:583,74239,357,40329,990,0001,073,0002,113,536
3Aug 27, 2026 12:583,75240,150,54030,006,0001,142,0002,113,536
4Aug 27, 2026 12:583,80339,929,45930,434,0001,134,0002,113,536
5Aug 27, 2026 12:583,81039,955,93130,532,0001,094,0002,113,536
6Aug 27, 2026 12:583,82240,748,32730,556,0001,168,0002,113,536
7Aug 27, 2026 12:583,83440,135,52030,659,0001,169,0002,113,536
8Aug 27, 2026 12:583,88940,590,84731,182,0001,097,0002,113,536
9Aug 27, 2026 12:583,94041,089,50631,617,0001,089,0002,113,536