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:49Wookyung JeongWookyung JeongScore: 394,877Success
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:49394,6463,301,402,2843,214,585,00060,973,0002,281,472
2Sep 25, 2025 06:49394,7473,300,136,1313,206,436,00069,965,0002,289,664
3Sep 25, 2025 06:49394,7493,305,259,5333,204,451,00071,965,0002,285,568
4Sep 25, 2025 06:49394,8333,308,912,4903,211,153,00065,962,0002,281,472
5Sep 25, 2025 06:49394,8773,305,856,1913,200,519,00076,964,0002,281,472
6Sep 25, 2025 06:49394,9943,306,564,1523,209,480,00068,967,0002,506,752
7Sep 25, 2025 06:49395,4403,306,179,7463,223,184,00058,966,0002,510,848
8Sep 25, 2025 06:49396,1713,319,326,8493,220,258,00067,963,0002,289,664
9Sep 25, 2025 06:49445,1723,719,083,6013,625,950,00068,980,0002,289,664