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 10:42wnwnScore: 98,743Success
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 10:4598,684494,288,797481,518,0002,038,0002,113,536
2May 11, 2026 10:4598,690493,883,821481,499,0002,084,0002,113,536
3May 11, 2026 10:4598,693493,286,082481,547,0002,051,0002,113,536
4May 11, 2026 10:4598,711493,514,719481,660,0002,025,0002,113,536
5May 11, 2026 10:4598,743494,534,913481,782,0002,061,0002,113,536
6May 11, 2026 10:4598,745493,918,999481,835,0002,016,0002,113,536
7May 11, 2026 10:4599,214497,167,035484,141,0002,012,0002,113,536
8May 11, 2026 10:4599,249496,199,468484,260,0002,063,0002,113,536
9May 11, 2026 10:4599,255495,189,071484,277,0002,073,0002,113,536