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 28, 2026 17:50Victor MerckléVictor MerckléScore: 4,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 17:514,15743,676,83533,426,0001,082,0002,113,536
2Jun 28, 2026 17:514,16642,290,13133,539,0001,040,0002,113,536
3Jun 28, 2026 17:514,17642,593,26133,621,0001,045,0002,113,536
4Jun 28, 2026 17:514,17842,327,54633,571,0001,112,0002,113,536
5Jun 28, 2026 17:514,19142,496,77033,682,0001,106,0002,113,536
6Jun 28, 2026 17:514,20142,781,11933,825,0001,049,0002,113,536
7Jun 28, 2026 17:514,28443,270,81934,472,0001,088,0002,113,536
8Jun 28, 2026 17:514,29643,557,18534,586,0001,072,0002,113,536
9Jun 28, 2026 17:514,30143,393,40634,697,0001,007,0002,113,536