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: 121,982Success
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:23121,938607,748,310596,498,0001,003,0002,113,536
2May 18, 2026 01:23121,949607,325,478596,414,0001,137,0002,113,536
3May 18, 2026 01:23121,957608,600,301596,443,0001,149,0002,113,536
4May 18, 2026 01:23121,969609,643,220596,506,0001,143,0002,113,536
5May 18, 2026 01:23121,982609,950,713596,708,0001,007,0002,113,536
6May 18, 2026 01:23122,035609,453,602596,974,0001,002,0002,113,536
7May 18, 2026 01:23122,172609,962,595597,641,0001,006,0002,113,536
8May 18, 2026 01:23122,175608,746,318597,572,0001,089,0002,113,536
9May 18, 2026 01:23122,658610,958,613600,021,0001,008,0002,113,536