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 24, 2025 10:44Jeffrey JianJeffrey JianScore: 2,069,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2025 10:442,067,32317,195,033,32617,100,812,00057,972,0002,277,376
2Nov 24, 2025 10:442,067,35717,191,668,13817,097,099,00061,967,0002,285,568
3Nov 24, 2025 10:442,067,95817,204,108,21617,096,088,00067,964,0002,277,376
4Nov 24, 2025 10:442,068,56117,208,866,13017,107,082,00061,971,0002,260,992
5Nov 24, 2025 10:442,069,44617,210,900,34617,106,439,00069,964,0002,285,568
6Nov 24, 2025 10:442,069,46917,209,067,45817,100,630,00075,962,0002,277,376
7Nov 24, 2025 10:442,070,37017,219,121,02117,126,097,00057,973,0002,285,568
8Nov 24, 2025 10:442,074,82417,258,581,07317,160,070,00060,971,0002,289,664
9Nov 24, 2025 10:442,144,10017,825,696,02117,741,051,00054,975,0002,289,664