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 listAug 18, 2025 05:23Ashish AhujaAshish AhujaScore: 13,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 05:2513,203138,047,58999,621,0009,962,0002,342,912
2Aug 18, 2025 05:2313,277140,134,751102,189,0008,014,0002,441,216
3Aug 18, 2025 05:2513,291140,589,099104,302,0006,017,0002,527,232
4Aug 18, 2025 05:2313,476142,227,579102,865,0008,988,0002,277,376
5Aug 18, 2025 05:2313,562141,584,493102,603,0009,961,0002,347,008
6Aug 18, 2025 05:2513,638134,306,783104,184,0009,015,0002,351,104