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:46wnwnScore: 98,983Success
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:4898,474504,618,366480,488,0002,039,0002,113,536
2May 11, 2026 10:4898,495491,355,745480,620,0002,007,0002,113,536
3May 11, 2026 10:4898,504491,908,587480,631,0002,042,0002,113,536
4May 11, 2026 10:4898,933504,990,031483,771,0001,004,0002,113,536
5May 11, 2026 10:4898,983494,335,794482,990,0002,029,0002,113,536
6May 11, 2026 10:4899,056496,216,436483,337,0002,040,0002,113,536
7May 11, 2026 10:4899,075494,682,656483,451,0002,021,0002,113,536
8May 11, 2026 10:4899,134496,858,227483,732,0002,029,0002,113,536
9May 11, 2026 10:4899,304495,583,223484,588,0002,005,0002,113,536