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 5, 2026 21:59limanjun99limanjun99Score: 108,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 5, 2026 21:59107,802553,134,431527,228,0001,000,0002,293,760
2Apr 5, 2026 21:59107,960551,090,865527,005,0002,000,0002,371,584
3Apr 5, 2026 21:59108,534559,067,579529,817,0001,999,0002,293,760
4Apr 5, 2026 21:59108,674566,346,415529,508,0002,997,0002,269,184
5Apr 5, 2026 21:59108,736562,725,596531,809,000999,0002,293,760
6Apr 5, 2026 21:59108,980562,261,467531,002,0003,000,0002,293,760
7Apr 5, 2026 21:59109,582563,392,433533,951,0002,999,0002,293,760
8Apr 5, 2026 21:59110,226568,325,279537,106,0003,000,0002,273,280
9Apr 5, 2026 21:59110,473564,558,956539,317,0002,001,0002,273,280