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 15:15Victor MerckléVictor MerckléScore: 3,795Success
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 15:153,74839,526,99029,958,0001,151,0002,117,632stderr
2Aug 12, 2026 15:153,76339,644,90030,087,0001,146,0002,117,632stderr
3Aug 12, 2026 15:153,77140,049,67730,163,0001,141,0002,117,632stderr
4Aug 12, 2026 15:153,78540,012,28630,276,0001,142,0002,117,632stderr
5Aug 12, 2026 15:153,79539,907,69530,416,0001,085,0002,117,632stderr
6Aug 12, 2026 15:153,79939,921,51830,474,0001,061,0002,117,632stderr
7Aug 12, 2026 15:153,81940,066,94430,600,0001,099,0002,117,632stderr
8Aug 12, 2026 15:153,84840,327,51730,865,0001,074,0002,117,632stderr
9Aug 12, 2026 15:154,15543,583,26533,389,0001,104,0002,117,632stderr