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 13:03wnwnScore: 102,061Success
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 13:04101,461507,643,478496,004,0001,158,0002,113,536
2May 11, 2026 13:04101,500508,006,567496,124,0001,226,0002,113,536
3May 11, 2026 13:04101,528506,799,867496,328,0001,162,0002,113,536
4May 11, 2026 13:04101,976509,216,494498,680,0001,003,0002,113,536
5May 11, 2026 13:04102,061508,975,387498,932,0001,168,0002,113,536
6May 11, 2026 13:04102,096509,607,847499,118,0001,153,0002,113,536
7May 11, 2026 13:04102,188510,094,405499,567,0001,157,0002,113,536
8May 11, 2026 13:04102,257509,851,065500,012,0001,052,0002,113,536
9May 11, 2026 13:04102,337511,343,323500,290,0001,165,0002,113,536