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 23, 2025 20:40Valentin KofmanValentin KofmanScore: 10,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 20:407,76486,722,22464,443,00002,289,664
2Jun 23, 2025 20:407,76989,328,48563,479,0001,007,0002,289,664
3Jun 23, 2025 20:407,80988,088,63263,801,0001,012,0002,273,280
4Jun 23, 2025 20:4010,938122,658,18788,793,0001,995,0002,265,088
5Jun 23, 2025 20:4010,965116,188,53989,006,0002,000,0002,289,664
6Jun 23, 2025 20:4010,973110,300,69589,075,0002,001,0002,289,664