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 listJan 8, 2025 09:09scompa18scompa18Score: 17,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2025 09:0917,597169,905,267144,054,0002,000,0002,281,472
2Jan 8, 2025 09:0917,600168,572,763144,078,0002,001,0002,281,472
3Jan 8, 2025 09:0917,608172,882,160144,148,0002,002,0002,269,184
4Jan 8, 2025 09:0917,611169,992,063144,166,0002,002,0002,281,472
5Jan 8, 2025 09:0917,612173,646,360145,179,0001,001,0002,527,232
6Jan 8, 2025 09:0917,615180,569,157144,206,0002,002,0002,527,232
7Jan 8, 2025 09:0917,620169,401,678144,240,0002,003,0002,269,184
8Jan 8, 2025 09:0917,630170,632,012145,323,0001,002,0002,523,136
9Jan 8, 2025 09:0917,636169,713,998146,375,00002,527,232