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 7, 2026 13:12Pavel SkripkinPavel SkripkinScore: 80,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 13:1280,488694,103,137433,384,000234,666,0002,334,720
2Jan 7, 2026 13:1280,749693,434,599434,490,000235,723,0002,285,568
3Jan 7, 2026 13:1281,244697,662,447434,567,000239,761,0002,482,176