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:08Rajarshi BasuRajarshi BasuScore: 6,405Success
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:086,22280,156,61650,628,0001,012,0002,281,472
2Dec 6, 2025 15:086,24276,257,84649,818,0001,992,0002,289,664
3Dec 6, 2025 15:086,39080,081,97951,039,0002,001,0002,289,664
4Dec 6, 2025 15:086,40579,009,81850,152,0003,009,0002,277,376
5Dec 6, 2025 15:086,43976,420,57652,436,0001,008,0002,289,664
6Dec 6, 2025 15:086,49282,105,24551,892,0001,995,0002,289,664