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:07wnwnScore: 101,404Success
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:08101,251505,860,083494,054,0002,080,0002,113,536
2May 11, 2026 13:08101,292506,759,793494,229,0002,103,0002,113,536
3May 11, 2026 13:08101,322506,382,162494,458,0002,023,0002,113,536
4May 11, 2026 13:08101,378505,407,859494,697,0002,057,0002,113,536
5May 11, 2026 13:08101,404508,444,236494,864,0002,018,0002,113,536
6May 11, 2026 13:08101,405505,810,450494,784,0002,102,0002,113,536
7May 11, 2026 13:08101,415506,755,038494,882,0002,053,0002,113,536
8May 11, 2026 13:08101,789508,824,420496,652,0002,117,0002,113,536
9May 11, 2026 13:08101,857507,762,053498,097,0001,005,0002,113,536