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:40Victor MerckléVictor MerckléScore: 3,778Success
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:413,73139,373,61929,927,0001,042,0002,117,632stderr
2Aug 12, 2026 15:413,75939,704,78030,056,0001,150,0002,117,632stderr
3Aug 12, 2026 15:413,76640,837,02730,131,0001,133,0002,117,632stderr
4Aug 12, 2026 15:413,76839,649,33530,176,0001,101,0002,117,632stderr
5Aug 12, 2026 15:413,77839,869,22430,182,0001,182,0002,117,632stderr
6Aug 12, 2026 15:413,78039,773,83630,300,0001,082,0002,117,632stderr
7Aug 12, 2026 15:413,78639,883,71430,334,0001,090,0002,117,632stderr
8Aug 12, 2026 15:413,79739,946,27030,379,0001,140,0002,117,632stderr
9Aug 12, 2026 15:413,85040,394,24630,868,0001,094,0002,117,632stderr