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 15, 2026 12:35Tomislav TunkovicTomislav TunkovicScore: 5,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 12:395,07050,843,96740,796,0001,286,0002,117,632
2Aug 15, 2026 12:395,07050,401,24340,791,0001,290,0002,117,632
3Aug 15, 2026 12:395,07250,407,23041,070,0001,035,0002,117,632
4Aug 15, 2026 12:395,07450,630,83140,804,0001,315,0002,117,632
5Aug 15, 2026 12:395,07650,373,77741,102,0001,037,0002,117,632
6Aug 15, 2026 12:395,07750,386,85841,111,0001,035,0002,117,632
7Aug 15, 2026 12:395,07851,042,70340,841,0001,312,0002,117,632
8Aug 15, 2026 12:395,07950,445,32840,855,0001,303,0002,117,632
9Aug 15, 2026 12:395,08650,591,50641,181,0001,036,0002,117,632