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 18:59Daniel MastalerzDaniel MastalerzScore: 7,172Success
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 18:597,01781,726,45054,224,0004,016,0002,326,528
2Feb 24, 2026 18:597,02591,787,70654,285,0004,021,0002,326,528
3Feb 24, 2026 18:597,02783,875,52554,300,0004,022,0002,285,568
4Feb 24, 2026 18:597,17285,410,95256,502,0003,026,0002,281,472
5Feb 24, 2026 18:597,19089,903,78456,641,0003,034,0002,318,336
6Feb 24, 2026 18:597,20591,462,14455,813,0003,986,0002,269,184