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 listJun 28, 2025 19:29Valentin KofmanValentin KofmanScore: 7,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 19:296,16274,498,96549,138,0002,005,0002,289,664
2Jun 28, 2025 19:296,16773,656,12050,181,0001,003,0002,289,664
3Jun 28, 2025 19:296,18974,042,00650,365,0001,007,0002,289,664
4Jun 28, 2025 19:297,47383,292,91860,023,0002,000,0002,289,664
5Jun 28, 2025 19:297,47588,277,14360,038,0002,001,0002,260,992
6Jun 28, 2025 19:297,49486,905,60660,198,0002,006,0002,289,664