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:12Rajarshi BasuRajarshi BasuScore: 6,387Success
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:126,24777,657,45949,854,0001,994,0002,289,664
2Dec 6, 2025 15:126,26776,731,90650,016,0002,000,0002,289,664
3Dec 6, 2025 15:126,33980,974,22050,589,0002,023,0002,289,664
4Dec 6, 2025 15:126,38777,319,54251,009,0002,000,0002,281,472
5Dec 6, 2025 15:126,39680,378,02752,084,0001,001,0002,281,472
6Dec 6, 2025 15:126,39976,925,12450,105,0003,006,0002,273,280