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 19, 2026 22:03Daniel MastalerzDaniel MastalerzScore: 5,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:035,74076,336,58144,601,0003,040,0002,371,584
2Feb 19, 2026 22:035,74278,898,48844,615,0003,041,0002,330,624
3Feb 19, 2026 22:035,76975,386,64943,892,0003,990,0002,330,624
4Feb 19, 2026 22:035,82372,924,83345,307,0003,020,0002,310,144
5Feb 19, 2026 22:035,83673,604,12545,409,0003,027,0002,310,144
6Feb 19, 2026 22:035,84074,132,78245,444,0003,029,0002,322,432