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 00:21Valentin KofmanValentin KofmanScore: 16,715Success
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 00:2116,697166,237,197137,581,0001,004,0002,289,664
2Jun 23, 2025 00:2116,698166,646,133137,591,0001,004,0002,289,664
3Jun 23, 2025 00:2116,709161,384,149136,691,0001,995,0002,273,280
4Jun 23, 2025 00:2116,714166,310,419137,732,000998,0002,289,664
5Jun 23, 2025 00:2116,715167,774,497137,738,000998,0002,289,664
6Jun 23, 2025 00:2116,717163,224,744136,758,0001,996,0002,289,664
7Jun 23, 2025 00:2116,718165,733,567137,758,000998,0002,265,088
8Jun 23, 2025 00:2116,722169,254,300136,799,0001,997,0002,269,184
9Jun 23, 2025 00:2116,723161,987,039136,806,0001,997,0002,289,664