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 12, 2026 14:45wnwnScore: 99,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 14:4699,569496,449,042486,681,0001,208,0002,113,536
2May 12, 2026 14:4699,582497,600,801486,884,0001,072,0002,113,536
3May 12, 2026 14:4699,610497,814,039486,962,0001,129,0002,113,536
4May 12, 2026 14:4699,619496,414,923486,940,0001,197,0002,113,536
5May 12, 2026 14:4699,630497,524,923487,027,0001,164,0002,113,536
6May 12, 2026 14:4699,640498,346,201487,201,0001,037,0002,113,536
7May 12, 2026 14:4699,642498,329,527487,054,0001,196,0002,113,536
8May 12, 2026 14:4699,661497,706,467487,146,0001,197,0002,113,536
9May 12, 2026 14:4699,727497,943,149487,582,0001,081,0002,113,536