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 05:45Saif Al-HarthiSaif Al-HarthiScore: 22,709Success
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 05:4522,632197,172,258186,847,0001,006,0002,113,536
2Jun 30, 2026 05:4522,653197,353,223187,016,0001,005,0002,113,536
3Jun 30, 2026 05:4522,657197,495,621187,056,0001,005,0002,113,536
4Jun 30, 2026 05:4522,659197,348,396187,069,0001,006,0002,113,536
5Jun 30, 2026 05:4522,709197,872,259187,484,0001,007,0002,113,536
6Jun 30, 2026 05:4522,728198,017,182187,637,0001,008,0002,113,536
7Jun 30, 2026 05:4522,780198,418,594188,072,0001,005,0002,113,536
8Jun 30, 2026 05:4522,799198,493,697188,231,0001,006,0002,113,536
9Jun 30, 2026 05:4522,937199,821,706189,377,0001,007,0002,113,536