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 14:32Saif Al-HarthiSaif Al-HarthiScore: 15,092Success
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 14:3315,059134,449,918123,870,0001,126,0002,117,632
2Jun 30, 2026 14:3315,075134,493,297123,988,0001,139,0002,117,632
3Jun 30, 2026 14:3315,075134,555,634124,000,0001,123,0002,117,632
4Jun 30, 2026 14:3315,079134,518,247123,912,0001,250,0002,117,632
5Jun 30, 2026 14:3315,092134,700,434124,137,0001,128,0002,117,632
6Jun 30, 2026 14:3315,097134,706,987124,167,0001,146,0002,117,632
7Jun 30, 2026 14:3315,128135,288,933124,451,0001,115,0002,117,632
8Jun 30, 2026 14:3315,134136,539,119124,489,0001,131,0002,117,632
9Jun 30, 2026 14:3315,187135,474,556124,910,0001,146,0002,117,632