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 29, 2026 13:06Saif Al-HarthiSaif Al-HarthiScore: 19,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 13:0619,070167,690,106157,281,0001,007,0002,113,536
2Jun 29, 2026 13:0619,340169,844,413159,516,0001,006,0002,113,536
3Jun 29, 2026 13:0619,345169,954,101159,563,0001,005,0002,113,536
4Jun 29, 2026 13:0619,349170,036,405159,594,0001,006,0002,113,536
5Jun 29, 2026 13:0619,350169,960,944159,604,0001,005,0002,113,536
6Jun 29, 2026 13:0619,357170,004,507159,659,0001,005,0002,113,536
7Jun 29, 2026 13:0619,359170,093,166159,675,0001,005,0002,113,536
8Jun 29, 2026 13:0620,049175,724,923165,404,0001,005,0002,113,536
9Jun 29, 2026 13:0620,054175,757,093165,449,0001,007,0002,113,536