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 4, 2025 13:13Rajarshi BasuRajarshi BasuScore: 10,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:1310,308116,590,71283,564,0001,989,0002,289,664
2Dec 4, 2025 13:1310,337114,347,75383,800,0001,995,0002,289,664
3Dec 4, 2025 13:1310,408110,247,46884,377,0002,008,0002,289,664
4Dec 4, 2025 13:1310,537114,612,29486,450,0001,005,0002,465,792
5Dec 4, 2025 13:1310,575115,659,95085,777,0001,994,0002,289,664
6Dec 4, 2025 13:1310,578115,317,47185,801,0001,995,0002,289,664