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 listJul 31, 2026 13:29CodeReclaimersCodeReclaimersScore: 15,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 13:3013,765124,276,405113,093,0001,160,0002,113,536
2Jul 31, 2026 13:3013,792124,560,089113,301,0001,174,0002,113,536
3Jul 31, 2026 13:3015,040134,934,447123,654,0001,180,0002,113,536
4Jul 31, 2026 13:3015,047134,937,729123,719,0001,174,0002,113,536
5Jul 31, 2026 13:3015,053134,988,158123,764,0001,183,0002,113,536
6Jul 31, 2026 13:3015,063135,101,348123,849,0001,174,0002,113,536
7Jul 31, 2026 13:3015,071135,493,378123,827,0001,264,0002,113,536
8Jul 31, 2026 13:3015,089135,356,242124,060,0001,185,0002,113,536
9Jul 31, 2026 13:3015,103136,215,937124,102,0001,260,0002,113,536