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 listJun 22, 2026 10:16Omkar SinghOmkar SinghScore: 380,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 10:17377,7103,144,298,8623,069,950,00065,049,0002,113,536
2Jun 22, 2026 10:17377,8743,145,908,0893,070,285,00066,073,0002,113,536
3Jun 22, 2026 10:17378,2133,148,438,5753,073,120,00066,051,0002,113,536
4Jun 22, 2026 10:17378,8563,154,080,6133,079,461,00065,050,0002,113,536
5Jun 22, 2026 10:17380,6713,168,870,3993,094,523,00065,047,0002,113,536
6Jun 22, 2026 10:17381,2673,173,864,4523,098,379,00066,139,0002,113,536
7Jun 22, 2026 10:17381,8283,178,552,3333,103,130,00066,046,0002,113,536
8Jun 22, 2026 10:17382,5523,184,890,0693,109,119,00066,067,0002,113,536
9Jun 22, 2026 10:17386,6433,218,588,5813,144,076,00065,063,0002,113,536