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 19, 2025 13:33PinKodPinKodScore: 2,066,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2025 13:332,062,92517,157,430,51817,063,307,00058,973,0002,277,376
2Nov 19, 2025 13:332,065,67817,176,101,19717,075,157,00069,967,0002,277,376
3Nov 19, 2025 13:332,065,81117,177,351,43617,093,256,00052,976,0002,277,376
4Nov 19, 2025 13:332,065,93617,178,163,13817,068,304,00078,964,0002,285,568
5Nov 19, 2025 13:332,066,21817,180,561,13517,081,638,00067,970,0002,277,376
6Nov 19, 2025 13:332,066,41917,191,010,57817,075,313,00075,965,0002,277,376
7Nov 19, 2025 13:332,068,56317,201,781,30417,103,111,00065,965,0002,277,376
8Nov 19, 2025 13:332,068,65917,204,730,54417,103,904,00065,964,0002,277,376
9Nov 19, 2025 13:332,078,42917,281,373,48717,187,994,00062,967,0002,277,376