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 26, 2026 00:24Karthik ReddyKarthik ReddyScore: 4,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 00:254,79150,022,51538,614,0001,158,0002,113,536
2Sep 26, 2026 00:254,84350,419,68239,075,0001,129,0002,113,536
3Sep 26, 2026 00:254,85051,660,43639,120,0001,139,0002,113,536
4Sep 26, 2026 00:254,85550,582,61639,153,0001,147,0002,113,536
5Sep 26, 2026 00:254,90650,955,12839,582,0001,143,0002,113,536
6Sep 26, 2026 00:254,91351,062,32539,636,0001,147,0002,113,536
7Sep 26, 2026 00:254,91651,020,06739,673,0001,131,0002,113,536
8Sep 26, 2026 00:254,92351,170,25839,732,0001,136,0002,113,536
9Sep 26, 2026 00:254,93851,193,23439,842,0001,145,0002,113,536