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 22, 2026 20:30M-RochatM-RochatScore: 111,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:31110,604552,384,508540,805,0001,158,0002,113,536
2May 22, 2026 20:31110,834552,722,548541,962,0001,129,0002,113,536
3May 22, 2026 20:31110,844552,659,939541,996,0001,143,0002,113,536
4May 22, 2026 20:31111,264556,671,744544,055,0001,143,0002,113,536
5May 22, 2026 20:31111,407557,646,930544,752,0001,145,0002,113,536
6May 22, 2026 20:31111,685557,083,700546,114,0001,145,0002,113,536
7May 22, 2026 20:31112,568563,614,065550,451,0001,135,0002,113,536
8May 22, 2026 20:31112,603562,191,518550,622,0001,136,0002,113,536
9May 22, 2026 20:31113,075565,162,112552,944,0001,126,0002,113,536