Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listApr 4, 2026 05:13limanjun99limanjun99Score: 115,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2026 05:13115,158591,537,789562,276,0002,000,0002,293,760
2Apr 4, 2026 05:13115,199590,472,168561,478,0002,997,0002,293,760
3Apr 4, 2026 05:13115,352590,380,522563,225,0002,000,0002,293,760
4Apr 4, 2026 05:13115,419592,830,640564,555,000999,0002,269,184
5Apr 4, 2026 05:13115,578594,955,644564,334,0001,997,0002,293,760
6Apr 4, 2026 05:13115,599597,695,851563,439,0002,997,0002,269,184
7Apr 4, 2026 05:13115,610595,698,196563,494,0002,997,0002,273,280
8Apr 4, 2026 05:13115,613590,123,513565,506,000999,0002,293,760
9Apr 4, 2026 05:13115,766594,941,872565,254,0002,000,0002,293,760