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 13, 2026 21:09Daniel MastalerzDaniel MastalerzScore: 7,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 21:096,99684,864,65855,061,0003,003,0002,269,184
2Feb 13, 2026 21:096,99986,394,81554,085,0004,006,0002,322,432
3Feb 13, 2026 21:097,00786,722,64855,149,0003,008,0002,342,912
4Feb 13, 2026 21:097,01281,655,52254,186,0004,013,0002,289,664
5Feb 13, 2026 21:097,01686,679,91352,211,0006,024,0002,269,184
6Feb 13, 2026 21:097,01682,970,64656,228,0002,008,0002,277,376
7Feb 13, 2026 21:097,02081,546,23455,255,0003,013,0002,265,088
8Feb 13, 2026 21:097,02485,760,11552,268,0006,030,0002,277,376
9Feb 13, 2026 21:097,03782,518,97152,364,0006,042,0002,269,184
10Feb 13, 2026 21:097,15282,433,87653,327,0006,037,0002,265,088
11Feb 13, 2026 21:097,17790,772,93155,529,0004,038,0002,265,088
12Feb 13, 2026 21:097,20092,988,38952,788,0006,972,0002,301,952