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 listJun 30, 2026 10:25Saif Al-HarthiSaif Al-HarthiScore: 15,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:2615,662139,527,466128,988,0001,007,0002,113,536
2Jun 30, 2026 10:2615,697139,587,169129,281,0001,005,0002,113,536
3Jun 30, 2026 10:2615,700139,673,978129,305,0001,006,0002,113,536
4Jun 30, 2026 10:2615,739150,277,007129,630,0001,005,0002,113,536
5Jun 30, 2026 10:2615,772140,154,792129,903,0001,005,0002,113,536
6Jun 30, 2026 10:2615,800140,477,550130,142,0001,005,0002,113,536
7Jun 30, 2026 10:2615,948141,697,106131,370,0001,004,0002,113,536
8Jun 30, 2026 10:2615,961141,851,540131,479,0001,005,0002,113,536
9Jun 30, 2026 10:2616,016142,280,630131,936,0001,004,0002,113,536