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 09:55wnwnScore: 99,177Success
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 09:5698,672493,087,857481,462,0002,032,0002,113,536
2May 11, 2026 09:5698,694494,196,084481,557,0002,046,0002,113,536
3May 11, 2026 09:5698,805493,357,823482,113,0002,032,0002,113,536
4May 11, 2026 09:5698,898495,088,900482,543,0002,059,0002,113,536
5May 11, 2026 09:5699,177495,010,437483,917,0002,051,0002,113,536
6May 11, 2026 09:5699,208496,470,831484,051,0002,073,0002,113,536
7May 11, 2026 09:5699,245496,671,325484,264,0002,037,0002,113,536
8May 11, 2026 09:5699,281495,290,787484,442,0002,035,0002,113,536
9May 11, 2026 09:5699,298498,363,400484,545,0002,017,0002,113,536