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:14Valentin KofmanValentin KofmanScore: 11,026Success
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:1410,901113,156,43989,472,0001,005,0002,289,664
2Jun 23, 2025 19:1410,986114,636,59889,183,0002,004,0002,289,664
3Jun 23, 2025 19:1410,991112,721,56289,224,0002,005,0002,289,664
4Jun 23, 2025 19:1411,013114,836,12289,402,0002,009,0002,289,664
5Jun 23, 2025 19:1411,014115,130,60790,413,0001,004,0002,273,280
6Jun 23, 2025 19:1411,025119,239,20190,504,0001,005,0002,289,664
7Jun 23, 2025 19:1411,026120,260,78290,513,0001,005,0002,289,664
8Jun 23, 2025 19:1411,036119,876,63390,591,0001,006,0002,289,664
9Jun 23, 2025 19:1411,039117,908,22290,616,0001,006,0002,289,664
10Jun 23, 2025 19:1411,056117,004,16990,767,000997,0002,260,992
11Jun 23, 2025 19:1411,057115,340,93490,774,000997,0002,289,664
12Jun 23, 2025 19:1411,063118,054,30190,828,000998,0002,277,376