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 19:08Victor MerckléVictor MerckléScore: 22,551Success
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 19:0822,265192,416,434182,667,0002,135,0002,113,536
2Jun 17, 2026 19:0822,419193,777,972183,890,0002,190,0002,113,536
3Jun 17, 2026 19:0822,452195,081,705184,183,0002,170,0002,113,536
4Jun 17, 2026 19:0822,478194,026,993184,482,0002,087,0002,113,536
5Jun 17, 2026 19:0822,551194,736,649185,019,0002,157,0002,113,536
6Jun 17, 2026 19:0822,586194,884,400185,294,0002,175,0002,113,536
7Jun 17, 2026 19:0822,618195,290,286185,573,0002,159,0002,113,536
8Jun 17, 2026 19:0822,667195,669,125186,054,0002,088,0002,113,536
9Jun 17, 2026 19:0822,673195,664,405186,066,0002,126,0002,113,536