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 18, 2026 01:21M-RochatM-RochatScore: 113,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:22112,004558,598,158547,696,0001,128,0002,113,536
2May 18, 2026 01:22112,016559,108,207547,744,0001,139,0002,113,536
3May 18, 2026 01:22113,338567,411,966554,237,0001,124,0002,113,536
4May 18, 2026 01:22113,382566,140,445554,456,0001,119,0002,113,536
5May 18, 2026 01:22113,663566,729,638555,806,0001,145,0002,113,536
6May 18, 2026 01:22116,395587,425,753569,173,0001,165,0002,113,536
7May 18, 2026 01:22116,619582,068,209569,180,0002,256,0002,113,536
8May 18, 2026 01:22141,289703,330,220691,164,0001,153,0002,113,536
9May 18, 2026 01:22153,770765,176,128752,333,0001,143,0002,113,536