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 listFeb 24, 2026 20:52Mikołaj UzarskiMikołaj UzarskiScore: 5,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 20:525,48966,381,51344,543,0001,012,0002,281,472
2Feb 24, 2026 20:525,51972,594,23744,814,000995,0002,506,752
3Feb 24, 2026 20:525,52668,644,26643,875,0001,994,0002,506,752
4Feb 24, 2026 20:525,52768,474,16143,880,0001,994,0002,506,752
5Feb 24, 2026 20:525,52973,979,09943,898,0001,995,0002,277,376
6Feb 24, 2026 20:525,53273,024,74043,916,0001,996,0002,506,752
7Feb 24, 2026 20:525,53377,750,39543,924,0001,996,0002,510,848
8Feb 24, 2026 20:525,53670,831,88643,954,0001,997,0002,285,568
9Feb 24, 2026 20:525,53869,407,53644,969,000999,0002,514,944
10Feb 24, 2026 20:525,55369,376,85244,084,0002,003,0002,342,912
11Feb 24, 2026 20:525,56567,454,57343,176,0003,012,0002,510,848
12Feb 24, 2026 20:525,56668,341,87444,189,0002,008,0002,510,848