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 17, 2026 09:22Serge SmirnovSerge SmirnovScore: 29,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 09:2229,172251,358,208240,919,0001,212,0002,113,536
2Jun 17, 2026 09:2229,174251,499,919240,900,0001,247,0002,113,536
3Jun 17, 2026 09:2229,176251,850,151240,909,0001,256,0002,113,536
4Jun 17, 2026 09:2229,176251,419,836240,926,0001,235,0002,113,536
5Jun 17, 2026 09:2229,177251,412,103240,926,0001,246,0002,113,536
6Jun 17, 2026 09:2229,177253,031,210240,940,0001,233,0002,113,536
7Jun 17, 2026 09:2229,177251,897,406240,921,0001,251,0002,113,536
8Jun 17, 2026 09:2229,182251,851,098241,210,0001,003,0002,113,536
9Jun 17, 2026 09:2229,193252,104,201241,301,0001,003,0002,113,536