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 12:02Rajarshi BasuRajarshi BasuScore: 6,950Success
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 12:026,79180,010,86554,356,0002,013,0002,289,664
2Dec 6, 2025 12:026,82881,043,86754,687,0001,988,0002,289,664
3Dec 6, 2025 12:026,84381,973,07655,805,000996,0002,387,968
4Dec 6, 2025 12:026,95085,264,07957,682,00002,289,664
5Dec 6, 2025 12:026,96989,922,24256,844,000997,0002,277,376
6Dec 6, 2025 12:027,14389,930,77357,277,0002,009,0002,289,664