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 18, 2025 12:52Ashish AhujaAshish AhujaScore: 11,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 12:5210,857116,224,27083,102,0007,008,0002,273,280
2Aug 18, 2025 12:5210,869117,264,76985,200,0005,011,0002,265,088
3Aug 18, 2025 12:5210,935120,251,64985,773,0004,986,0002,355,200
4Aug 18, 2025 12:5210,938120,827,01284,803,0005,986,0002,359,296
5Aug 18, 2025 12:5210,973120,304,11885,072,0006,005,0002,531,328
6Aug 18, 2025 12:5210,996122,758,97186,255,0005,014,0002,473,984
7Aug 18, 2025 12:5211,008118,640,64586,349,0005,020,0002,486,272
8Aug 18, 2025 12:5211,024115,472,44684,539,0006,962,0002,322,432
9Aug 18, 2025 12:5211,025116,883,91183,551,0007,957,0002,519,040
10Aug 18, 2025 12:5211,112119,483,17885,210,0007,017,0002,293,760
11Aug 18, 2025 12:5211,160118,629,68484,659,0007,967,0002,293,760
12Aug 18, 2025 12:5211,217119,622,13587,093,0006,006,0002,277,376