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 15, 2025 14:22SemyonSemyonScore: 2,066,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2025 14:222,065,80717,177,035,88617,096,224,00049,977,0002,379,776
2Aug 15, 2025 14:222,066,04317,181,865,50617,071,197,00076,964,0002,277,376
3Aug 15, 2025 14:222,066,25317,184,803,35117,063,938,00085,964,0002,277,376
4Aug 15, 2025 14:222,066,54017,183,527,76117,081,316,00070,963,0002,277,376
5Aug 15, 2025 14:222,066,84317,185,820,60717,096,818,00057,975,0002,277,376
6Aug 15, 2025 14:222,068,96817,200,667,44017,100,466,00071,972,0002,277,376
7Aug 15, 2025 14:222,069,08617,204,813,46117,113,444,00059,970,0002,285,568
8Aug 15, 2025 14:222,069,79217,208,964,92117,102,304,00076,969,0002,277,376
9Aug 15, 2025 14:222,071,84717,232,482,63317,133,362,00062,968,0002,277,376