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 listNov 29, 2025 19:48Rajarshi BasuRajarshi BasuScore: 25,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2025 19:4825,489240,237,539210,554,0001,002,0002,289,664
2Nov 29, 2025 19:4825,513238,518,988209,763,0001,997,0002,273,280
3Nov 29, 2025 19:4825,514235,164,401210,766,000998,0002,269,184
4Nov 29, 2025 19:4825,517237,901,722209,794,0001,998,0002,289,664
5Nov 29, 2025 19:4825,528240,779,375210,882,000999,0002,289,664
6Nov 29, 2025 19:4825,530234,727,667209,897,0001,999,0002,371,584
7Nov 29, 2025 19:4825,540241,282,703209,980,0001,999,0002,289,664
8Nov 29, 2025 19:4825,555235,307,384211,104,0001,000,0002,289,664
9Nov 29, 2025 19:4831,547285,502,189259,846,0001,998,0002,375,680