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 listMay 11, 2026 07:19wnwnScore: 109,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:21106,456531,965,775518,387,0003,248,0002,113,536
2May 11, 2026 07:21106,510531,252,433518,652,0003,250,0002,113,536
3May 11, 2026 07:21106,614533,183,880519,228,0003,181,0002,113,536
4May 11, 2026 07:21107,031533,313,455521,337,0003,119,0002,113,536
5May 11, 2026 07:21109,970549,769,382535,685,0003,171,0002,113,536
6May 11, 2026 07:21109,976549,411,579535,650,0003,234,0002,113,536
7May 11, 2026 07:21110,389550,110,013537,660,0003,247,0002,113,536
8May 11, 2026 07:21113,371567,931,150552,271,0003,248,0002,113,536
9May 11, 2026 07:21133,456664,330,083650,796,0003,143,0002,113,536