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 11:53Rajarshi BasuRajarshi BasuScore: 6,640Success
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 11:536,48877,285,68652,850,000997,0002,289,664
2Dec 6, 2025 11:536,50084,614,38752,954,000999,0002,289,664
3Dec 6, 2025 11:536,50480,937,44551,987,0001,999,0002,281,472
4Dec 6, 2025 11:536,64079,931,22954,110,0001,002,0002,289,664
5Dec 6, 2025 11:536,64282,593,69255,125,00002,289,664
6Dec 6, 2025 11:536,65281,122,79253,207,0002,007,0002,297,856