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 18, 2025 15:25KatDyrebyKatDyrebyScore: 1,826,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2025 15:251,825,44115,188,242,87915,096,186,00054,978,0002,277,376
2Jan 18, 2025 15:251,825,75015,190,061,43115,068,758,00084,964,0002,289,664
3Jan 18, 2025 15:251,825,99915,186,582,82815,077,830,00077,962,0002,277,376
4Jan 18, 2025 15:251,826,12115,186,476,21515,075,836,00080,966,0002,265,088
5Jan 18, 2025 15:251,826,79815,192,536,10815,082,456,00079,965,0002,289,664
6Jan 18, 2025 15:251,827,98915,207,634,51715,105,342,00066,966,0002,277,376
7Jan 18, 2025 15:251,828,46115,211,200,07415,103,263,00072,967,0002,289,664
8Jan 18, 2025 15:251,830,87415,233,549,21615,121,296,00074,961,0002,289,664
9Jan 18, 2025 15:251,832,42515,240,680,78915,132,161,00076,970,0002,277,376