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 19:20Valentin KofmanValentin KofmanScore: 10,173Success
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 19:2010,137106,688,28182,133,0002,003,0002,265,088
2Jun 23, 2025 19:2010,154106,723,93882,271,0002,006,0002,281,472
3Jun 23, 2025 19:2010,166104,534,26583,371,0001,004,0002,273,280
4Jun 23, 2025 19:2010,170109,690,69483,408,0001,004,0002,269,184
5Jun 23, 2025 19:2010,171108,542,95083,418,0001,005,0002,277,376
6Jun 23, 2025 19:2010,171113,794,79383,416,0001,005,0002,273,280
7Jun 23, 2025 19:2010,173106,992,25483,434,0001,005,0002,392,064
8Jun 23, 2025 19:2010,179110,603,15883,484,0001,005,0002,289,664
9Jun 23, 2025 19:2010,179107,033,35583,482,0001,005,0002,289,664
10Jun 23, 2025 19:2010,180111,873,26184,496,00002,269,184
11Jun 23, 2025 19:2010,184115,222,56083,524,0001,006,0002,273,280
12Jun 23, 2025 19:2010,214112,218,31282,786,0001,994,0002,277,376