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 29, 2026 06:54Karthik ReddyKarthik ReddyScore: 8,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 06:548,12777,852,10566,332,0001,130,0002,113,536
2Sep 29, 2026 06:548,13177,813,81866,354,0001,137,0002,113,536
3Sep 29, 2026 06:548,13577,759,10766,384,0001,138,0002,113,536
4Sep 29, 2026 06:548,15077,987,77066,470,0001,182,0002,113,536
5Sep 29, 2026 06:548,15478,065,77766,524,0001,156,0002,113,536
6Sep 29, 2026 06:548,15778,000,62866,561,0001,149,0002,113,536
7Sep 29, 2026 06:548,16078,074,60166,591,0001,145,0002,113,536
8Sep 29, 2026 06:548,17178,218,62566,732,0001,089,0002,113,536
9Sep 29, 2026 06:548,31379,269,95667,836,0001,164,0002,113,536