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 10, 2026 20:11Daniel MastalerzDaniel MastalerzScore: 9,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 20:119,16496,991,32074,061,0002,001,0002,523,136
2Feb 10, 2026 20:119,17099,659,52574,111,0002,003,0002,277,376
3Feb 10, 2026 20:119,174104,980,85874,145,0002,003,0002,289,664
4Feb 10, 2026 20:119,33699,680,26075,474,0002,012,0002,273,280
5Feb 10, 2026 20:119,424103,685,07176,218,0002,005,0002,265,088
6Feb 10, 2026 20:119,477104,646,66576,644,0002,016,0002,293,760