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 02:57Victor MerckléVictor MerckléScore: 10,060Success
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 02:5810,01891,525,92382,098,0001,057,0002,117,632stderr
2Aug 25, 2026 02:5810,02691,598,67082,139,0001,085,0002,117,632stderr
3Aug 25, 2026 02:5810,03291,667,32782,193,0001,080,0002,117,632stderr
4Aug 25, 2026 02:5810,05291,795,28182,352,0001,086,0002,117,632stderr
5Aug 25, 2026 02:5810,06091,979,39082,406,0001,093,0002,117,632stderr
6Aug 25, 2026 02:5810,06491,897,38082,465,0001,074,0002,117,632stderr
7Aug 25, 2026 02:5810,06991,927,95682,484,0001,089,0002,117,632stderr
8Aug 25, 2026 02:5810,08792,317,22782,638,0001,089,0002,117,632stderr
9Aug 25, 2026 02:5810,11092,300,96882,833,0001,087,0002,117,632stderr