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 17, 2026 02:43M-RochatM-RochatScore: 121,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 17, 2026 02:48118,544589,709,319579,776,0001,091,0002,113,536
2May 17, 2026 02:48118,982591,800,963581,908,0001,106,0002,113,536
3May 17, 2026 02:48120,578599,733,397589,832,0001,003,0002,113,536
4May 17, 2026 02:48121,160602,500,738592,518,0001,169,0002,113,536
5May 17, 2026 02:48121,407603,730,648593,774,0001,124,0002,113,536
6May 17, 2026 02:48121,706605,262,646595,180,0001,181,0002,113,536
7May 17, 2026 02:48122,689610,183,494600,169,0001,010,0002,113,536
8May 17, 2026 02:48123,325613,113,597603,169,0001,124,0002,113,536
9May 17, 2026 02:48123,847615,732,566605,694,0001,159,0002,113,536