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 listAug 19, 2025 07:13Joseph FeranoJoseph FeranoScore: 2,066,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2025 07:132,062,68217,154,444,81217,056,291,00063,967,0002,285,568
2Aug 19, 2025 07:132,063,80817,162,453,24617,064,634,00064,971,0002,371,584
3Aug 19, 2025 07:132,064,33017,166,270,28017,068,970,00064,965,0002,265,088
4Aug 19, 2025 07:132,065,15417,169,806,51917,070,811,00069,970,0002,289,664
5Aug 19, 2025 07:132,066,39517,185,456,56317,099,097,00051,979,0002,285,568
6Aug 19, 2025 07:132,067,81217,195,458,74617,106,860,00055,976,0002,277,376
7Aug 19, 2025 07:132,069,63517,208,940,28217,104,002,00073,969,0002,277,376
8Aug 19, 2025 07:132,069,82817,212,791,75717,112,597,00066,974,0002,285,568
9Aug 19, 2025 07:132,070,16517,209,229,79617,128,392,00053,979,0002,265,088