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 3, 2026 20:31Josu San MartinJosu San MartinScore: 6,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:316,72065,122,33651,596,0004,186,0002,113,536
2Jul 3, 2026 20:316,72265,145,98751,544,0004,251,0002,113,536
3Jul 3, 2026 20:316,73965,404,96551,723,0004,214,0002,113,536
4Jul 3, 2026 20:316,73965,261,98051,718,0004,223,0002,113,536
5Jul 3, 2026 20:316,74365,294,39951,665,0004,305,0002,113,536
6Jul 3, 2026 20:316,76765,533,64951,913,0004,255,0002,113,536
7Jul 3, 2026 20:316,76865,531,50051,991,0004,184,0002,113,536
8Jul 3, 2026 20:316,78665,719,66052,105,0004,225,0002,113,536
9Jul 3, 2026 20:316,80665,934,17052,161,0004,335,0002,113,536