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 24, 2025 23:15Valentin KofmanValentin KofmanScore: 13,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2025 23:1510,007107,979,58581,060,0002,001,0002,289,664
2Jun 24, 2025 23:1510,010109,091,86481,078,0002,001,0002,289,664
3Jun 24, 2025 23:1510,157105,085,38082,294,0002,007,0002,273,280
4Jun 24, 2025 23:1513,204138,270,911108,591,0001,005,0002,273,280
5Jun 24, 2025 23:1513,208142,526,365108,620,0001,005,0002,269,184
6Jun 24, 2025 23:1513,275134,888,067108,178,0002,003,0002,260,992