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 16, 2026 21:12M-RochatM-RochatScore: 159,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 21:13158,671788,845,545775,429,0002,063,0002,113,536
2May 16, 2026 21:13159,003789,910,303777,045,0002,071,0002,113,536
3May 16, 2026 21:13159,007791,103,713777,018,0002,121,0002,113,536
4May 16, 2026 21:13159,467790,415,799779,352,0002,037,0002,113,536
5May 16, 2026 21:13159,970792,941,891781,771,0002,084,0002,113,536
6May 16, 2026 21:13160,212793,916,123783,021,0002,020,0002,113,536
7May 16, 2026 21:13160,506798,221,953784,339,0002,145,0002,113,536
8May 16, 2026 21:13161,547801,148,107789,509,0002,074,0002,113,536
9May 16, 2026 21:13161,726802,899,593790,414,0002,048,0002,113,536