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 listJan 7, 2026 12:01Shubham Kr. VermaShubham Kr. VermaScore: 2,066,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 12:012,061,47317,140,389,45617,043,257,00066,969,0002,293,760
2Jan 7, 2026 12:012,064,42517,170,006,20117,057,764,00076,962,0002,281,472
3Jan 7, 2026 12:012,065,29217,170,019,33317,060,961,00080,966,0002,281,472
4Jan 7, 2026 12:012,065,65517,173,901,74717,064,967,00079,967,0002,281,472
5Jan 7, 2026 12:012,066,58317,181,376,85417,079,669,00072,968,0002,281,472
6Jan 7, 2026 12:012,069,83217,208,095,16717,112,635,00066,971,0002,281,472
7Jan 7, 2026 12:012,072,91517,236,135,46217,134,221,00070,971,0002,293,760
8Jan 7, 2026 12:012,076,92817,272,979,67317,174,534,00063,968,0002,281,472
9Jan 7, 2026 12:012,088,54117,367,999,30317,266,923,00067,968,0002,281,472