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 16:54Karthik ReddyKarthik ReddyScore: 3,643Success
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 16:553,58740,096,07928,668,0001,105,0002,113,536
2Sep 29, 2026 16:553,59840,349,02428,745,0001,122,0002,113,536
3Sep 29, 2026 16:553,60140,332,48928,769,0001,122,0002,113,536
4Sep 29, 2026 16:553,62440,453,39528,963,0001,120,0002,113,536
5Sep 29, 2026 16:553,64340,589,80529,100,0001,144,0002,113,536
6Sep 29, 2026 16:553,67440,839,11529,343,0001,152,0002,113,536
7Sep 29, 2026 16:553,68440,872,68729,427,0001,157,0002,113,536
8Sep 29, 2026 16:553,69441,163,71029,498,0001,166,0002,113,536
9Sep 29, 2026 16:553,69841,086,92129,546,0001,148,0002,113,536