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 listDec 6, 2025 15:10Rajarshi BasuRajarshi BasuScore: 8,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:107,970100,931,67864,148,0002,004,0002,285,568
2Dec 6, 2025 15:107,98190,377,80464,233,0002,007,0002,289,664
3Dec 6, 2025 15:108,04694,403,72664,786,0001,993,0002,527,232
4Dec 6, 2025 15:108,14997,293,60967,635,00002,289,664
5Dec 6, 2025 15:108,17097,813,09465,820,0001,994,0002,289,664
6Dec 6, 2025 15:108,17497,866,18565,847,0001,995,0002,273,280