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 12, 2026 06:32Victor MerckléVictor MerckléScore: 3,780Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 06:333,74939,631,54729,985,0001,135,0002,117,632stderr
2Aug 12, 2026 06:333,75239,562,00830,043,0001,105,0002,117,632stderr
3Aug 12, 2026 06:333,76239,651,13230,104,0001,127,0002,117,632stderr
4Aug 12, 2026 06:333,76939,673,27730,160,0001,127,0002,117,632stderr
5Aug 12, 2026 06:333,78039,727,06130,239,0001,135,0002,117,632stderr
6Aug 12, 2026 06:333,78139,838,52630,300,0001,089,0002,117,632stderr
7Aug 12, 2026 06:333,79639,867,95330,439,0001,073,0002,117,632stderr
8Aug 12, 2026 06:333,81340,110,98030,556,0001,093,0002,117,632stderr
9Aug 12, 2026 06:333,81740,076,34530,598,0001,086,0002,117,632stderr