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 22:58Victor MerckléVictor MerckléScore: 3,813Success
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 22:593,77740,051,32830,285,0001,072,0002,117,632stderr
2Aug 12, 2026 22:593,77939,794,31430,297,0001,071,0002,117,632stderr
3Aug 12, 2026 22:593,78239,787,57530,306,0001,089,0002,117,632stderr
4Aug 12, 2026 22:593,78440,452,98030,252,0001,161,0002,117,632stderr
5Aug 12, 2026 22:593,81340,119,21830,483,0001,172,0002,117,632stderr
6Aug 12, 2026 22:593,82640,219,61030,594,0001,167,0002,117,632stderr
7Aug 12, 2026 22:593,82740,316,17030,632,0001,139,0002,117,632stderr
8Aug 12, 2026 22:593,84040,253,31230,763,0001,109,0002,117,632stderr
9Aug 12, 2026 22:593,84640,360,99630,837,0001,089,0002,117,632stderr