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 07:41Saif Al-HarthiSaif Al-HarthiScore: 13,838Success
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 07:4213,612122,739,193111,966,0001,016,0002,113,536
2Jun 30, 2026 07:4213,629122,900,944112,112,0001,014,0002,113,536
3Jun 30, 2026 07:4213,633123,747,094112,140,0001,014,0002,113,536
4Jun 30, 2026 07:4213,638122,478,242112,187,0001,015,0002,113,536
5Jun 30, 2026 07:4213,838124,099,455113,847,0001,014,0002,113,536
6Jun 30, 2026 07:4213,840124,200,900113,861,0001,014,0002,113,536
7Jun 30, 2026 07:4213,886124,910,242114,243,0001,016,0002,113,536
8Jun 30, 2026 07:4213,893124,605,697114,299,0001,014,0002,113,536
9Jun 30, 2026 07:4213,899124,630,251114,353,0001,015,0002,113,536