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 listFeb 12, 2025 22:08Miguel Rodrigues Carrilho BorgesMiguel Rodrigues Carrilho BorgesScore: 61,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2025 22:0860,877527,448,622504,283,0001,000,0002,289,664
2Feb 12, 2025 22:0860,878532,459,469505,288,00002,269,184
3Feb 12, 2025 22:0860,888534,431,776504,374,0001,000,0002,289,664
4Feb 12, 2025 22:0860,908535,703,263505,539,00002,289,664
5Feb 12, 2025 22:0861,001534,358,060505,311,0001,000,0002,281,472
6Feb 12, 2025 22:0861,002532,545,038505,314,0001,000,0002,269,184
7Feb 12, 2025 22:0861,004531,114,158505,337,0001,000,0002,293,760
8Feb 12, 2025 22:0861,034535,749,715505,585,000999,0002,383,872
9Feb 12, 2025 22:0861,045533,264,125504,679,0001,998,0002,277,376