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 listOct 1, 2026 08:25Karthik ReddyKarthik ReddyScore: 3,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 08:253,36536,916,99826,859,0001,073,0002,113,536
2Oct 1, 2026 08:253,37036,789,73326,874,0001,100,0002,113,536
3Oct 1, 2026 08:253,37737,060,64926,940,0001,097,0002,113,536
4Oct 1, 2026 08:253,38237,072,21026,989,0001,084,0002,113,536
5Oct 1, 2026 08:253,38437,182,41726,958,0001,133,0002,113,536
6Oct 1, 2026 08:253,38437,029,11126,988,0001,105,0002,113,536
7Oct 1, 2026 08:253,41437,332,47127,176,0001,166,0002,113,536
8Oct 1, 2026 08:253,41437,379,19627,173,0001,167,0002,113,536
9Oct 1, 2026 08:253,42037,392,03927,207,0001,179,0002,113,536