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 2, 2026 07:45Karthik ReddyKarthik ReddyScore: 3,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 07:463,2683,036,256,25927,127,000020,480
2Oct 2, 2026 07:463,2683,036,216,88627,126,000020,480
3Oct 2, 2026 07:463,2693,036,079,93226,132,0001,003,00020,480
4Oct 2, 2026 07:463,2703,036,282,70526,136,0001,010,00020,480
5Oct 2, 2026 07:463,2733,036,773,70026,171,0001,002,00020,480
6Oct 2, 2026 07:463,2763,036,303,25126,181,0001,011,00020,480
7Oct 2, 2026 07:463,2773,036,263,29227,201,000020,480
8Oct 2, 2026 07:463,2783,036,220,10826,187,0001,022,00020,480
9Oct 2, 2026 07:463,3783,037,145,76227,010,0001,033,00020,480