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 listSep 25, 2025 06:46Wookyung JeongWookyung JeongScore: 460,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 06:46460,0973,843,998,3713,740,846,00077,955,0002,281,472
2Sep 25, 2025 06:46460,2483,842,316,8183,756,095,00063,967,0002,289,664
3Sep 25, 2025 06:46460,3433,845,609,3453,745,891,00074,957,0002,285,568
4Sep 25, 2025 06:46460,5963,845,617,2513,741,991,00080,956,0002,289,664
5Sep 25, 2025 06:46460,7133,850,352,8773,742,960,00080,955,0002,289,664
6Sep 25, 2025 06:46463,8643,878,053,4253,774,107,00075,961,0002,289,664
7Sep 25, 2025 06:46468,8313,923,932,9323,815,353,00075,947,0002,281,472
8Sep 25, 2025 06:46469,7473,928,660,1843,820,939,00077,957,0002,519,040
9Sep 25, 2025 06:46474,7453,965,768,0033,871,430,00068,954,0002,289,664