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 listJan 31, 2026 13:21olliecrowolliecrowScore: 7,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 13:216,73588,188,69654,903,000998,0002,404,352
2Jan 31, 2026 13:216,74087,904,18354,946,000999,0002,469,888
3Jan 31, 2026 13:216,77182,505,50153,186,0003,010,0002,519,040
4Jan 31, 2026 13:217,09189,153,25557,862,000997,0002,510,848
5Jan 31, 2026 13:217,09983,722,61756,926,0001,997,0002,277,376
6Jan 31, 2026 13:217,10884,905,50457,996,000999,0002,334,720