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:25Valentin KofmanValentin KofmanScore: 12,510Success
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:259,608109,973,91578,752,000996,0002,289,664
2Jun 24, 2025 23:259,611112,788,09877,776,0001,994,0002,289,664
3Jun 24, 2025 23:259,613105,613,43177,795,0001,994,0002,281,472
4Jun 24, 2025 23:2512,510125,522,544102,831,000998,0002,277,376
5Jun 24, 2025 23:2512,539127,744,153102,073,0002,001,0002,289,664
6Jun 24, 2025 23:2512,549131,457,665102,154,0002,003,0002,273,280