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 25, 2025 11:37Valentin KofmanValentin KofmanScore: 7,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 11:376,10575,417,74949,659,0001,013,0002,269,184
2Jun 25, 2025 11:376,11977,546,19848,797,0001,991,0002,269,184
3Jun 25, 2025 11:376,12379,844,20849,825,000996,0002,269,184
4Jun 25, 2025 11:377,96494,971,93364,102,0002,003,0002,277,376
5Jun 25, 2025 11:377,99291,147,33466,331,00002,277,376
6Jun 25, 2025 11:378,00087,227,78166,401,00002,289,664