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 17:09Daniel MastalerzDaniel MastalerzScore: 7,361Success
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 17:097,20687,377,75656,817,0002,990,0002,269,184
2Feb 19, 2026 17:097,24682,815,29156,136,0004,009,0002,326,528
3Feb 19, 2026 17:097,25982,880,60257,237,0003,012,0002,273,280
4Feb 19, 2026 17:097,36184,808,54258,096,0003,004,0002,318,336
5Feb 19, 2026 17:097,37190,120,93757,171,0004,012,0002,310,144
6Feb 19, 2026 17:097,38784,353,47957,295,0004,020,0002,265,088