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 listJul 27, 2026 14:14Kevin HeaveyKevin HeaveyScore: 51,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 14:4451,254261,957,134242,142,0009,003,00020,480
2Jul 27, 2026 14:4451,292261,405,333242,354,0008,977,00020,480
3Jul 27, 2026 14:4451,305263,732,267242,598,0008,797,00020,480
4Jul 27, 2026 14:4451,548263,119,890242,341,00010,249,00020,480
5Jul 27, 2026 14:4451,699263,468,772242,108,00011,220,00020,480
6Jul 27, 2026 14:4451,715263,510,223242,944,00010,462,00020,480
7Jul 27, 2026 14:4451,731264,209,364243,178,00010,305,0002,113,536
8Jul 27, 2026 14:4451,752263,672,044242,142,00011,445,00020,480
9Jul 27, 2026 14:4451,972264,794,706242,134,00012,530,00020,480