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 9, 2026 07:41Karthik ReddyKarthik ReddyScore: 3,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:433,2343,035,538,10526,848,000020,480
2Oct 9, 2026 07:433,2593,035,957,49727,051,000020,480
3Oct 9, 2026 07:433,2613,035,993,19125,961,0001,107,00020,480
4Oct 9, 2026 07:433,2623,035,902,24227,080,000020,480
5Oct 9, 2026 07:433,2623,035,716,82427,076,000020,480
6Oct 9, 2026 07:433,2763,036,080,03627,198,000020,480
7Oct 9, 2026 07:433,2803,036,034,44726,218,0001,011,00020,480
8Oct 9, 2026 07:433,3163,036,266,84226,495,0001,032,00020,480
9Oct 9, 2026 07:433,3373,036,496,18827,702,000020,480