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 10:22Valentin KofmanValentin KofmanScore: 6,088Success
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 10:226,06375,095,49048,311,0002,012,0002,289,664
2Jun 25, 2025 10:226,07272,131,88549,392,0001,008,0002,289,664
3Jun 25, 2025 10:226,07476,845,81949,405,0001,008,0002,269,184
4Jun 25, 2025 10:226,07778,820,91349,427,0001,008,0002,289,664
5Jun 25, 2025 10:226,08178,056,95250,470,00002,260,992
6Jun 25, 2025 10:226,08373,004,88749,480,0001,009,0002,519,040
7Jun 25, 2025 10:226,08877,107,97149,520,0001,010,0002,289,664
8Jun 25, 2025 10:226,11678,353,72748,772,0001,990,0002,289,664
9Jun 25, 2025 10:226,18974,622,48950,363,0001,007,0002,289,664
10Jun 25, 2025 10:227,96692,077,25065,114,0001,001,0002,289,664
11Jun 25, 2025 10:227,97486,595,54164,176,0002,005,0002,269,184
12Jun 25, 2025 10:227,98691,251,64064,275,0002,008,0002,289,664