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 4, 2025 13:36Rajarshi BasuRajarshi BasuScore: 8,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:368,26393,226,06567,579,0001,008,0002,486,272
2Dec 4, 2025 13:368,29293,516,21267,812,0001,012,0002,486,272
3Dec 4, 2025 13:368,30594,140,33866,935,0001,998,0002,289,664
4Dec 4, 2025 13:368,40796,737,73368,781,000996,0002,289,664
5Dec 4, 2025 13:368,40995,937,48568,798,000997,0002,494,464
6Dec 4, 2025 13:368,42895,573,40168,951,000999,0002,289,664