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 8, 2026 12:15Daniel MastalerzDaniel MastalerzScore: 13,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 12:1513,336132,959,095103,707,0006,980,0002,408,448
2Feb 8, 2026 12:1513,337137,935,998102,720,0007,978,0002,306,048
3Feb 8, 2026 12:1513,339138,632,758104,726,0005,984,0002,318,336
4Feb 8, 2026 12:1513,340136,374,693103,744,0006,982,0002,318,336
5Feb 8, 2026 12:1513,341139,361,621102,750,0007,980,0002,404,352
6Feb 8, 2026 12:1513,351134,248,837103,823,0006,988,0002,396,160
7Feb 8, 2026 12:1513,401134,885,157105,213,0006,012,0002,400,256
8Feb 8, 2026 12:1513,468136,963,636103,797,0007,984,0002,363,392
9Feb 8, 2026 12:1513,472139,427,611104,832,0006,988,0002,310,144