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:05Daniel MastalerzDaniel MastalerzScore: 9,602Success
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:059,420101,001,16572,172,0006,014,0002,523,136
2Feb 13, 2026 21:059,429107,489,76872,244,0006,020,0002,347,008
3Feb 13, 2026 21:059,450103,738,41574,409,0004,022,0002,265,088
4Feb 13, 2026 21:059,602106,354,84276,712,0002,988,0002,322,432
5Feb 13, 2026 21:059,624103,101,29376,882,0002,995,0002,306,048
6Feb 13, 2026 21:059,631101,482,91674,941,0004,996,0002,269,184