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 22, 2025 16:09Valentin KofmanValentin KofmanScore: 24,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 16:0924,739231,185,731204,333,0001,001,0002,277,376
2Jun 22, 2025 16:0924,749230,689,495204,413,0001,002,0002,277,376
3Jun 22, 2025 16:0924,755231,363,201205,470,00002,273,280
4Jun 22, 2025 16:0924,756233,816,455204,476,0001,002,0002,269,184
5Jun 22, 2025 16:0924,758236,125,667205,494,00002,273,280
6Jun 22, 2025 16:0924,759233,894,471204,496,0001,002,0002,285,568
7Jun 22, 2025 16:0924,763231,189,551204,531,0001,002,0002,281,472
8Jun 22, 2025 16:0924,786232,422,667204,722,000998,0002,289,664
9Jun 22, 2025 16:0924,787231,885,133204,731,000998,0002,281,472