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:26M-RochatM-RochatScore: 113,887Success
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:28110,378553,017,755539,693,0001,160,0002,113,536
2May 18, 2026 01:28110,718554,210,432541,348,0001,174,0002,113,536
3May 18, 2026 01:28110,948554,987,536542,493,0001,154,0002,113,536
4May 18, 2026 01:28111,153556,577,944543,488,0001,164,0002,113,536
5May 18, 2026 01:28113,887570,412,197556,899,0001,150,0002,113,536
6May 18, 2026 01:28113,936568,377,132557,151,0001,138,0002,113,536
7May 18, 2026 01:28114,063570,661,309557,778,0001,135,0002,113,536
8May 18, 2026 01:28114,325571,258,778559,027,0001,169,0002,113,536
9May 18, 2026 01:28114,487571,822,808559,853,0001,138,0002,113,536