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 11, 2026 07:15wnwnScore: 112,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:16108,353540,217,640527,920,0003,010,0002,113,536
2May 11, 2026 07:16108,508540,933,538528,519,0003,173,0002,113,536
3May 11, 2026 07:16108,629540,960,151529,252,0003,032,0002,113,536
4May 11, 2026 07:16112,384559,450,316547,427,0003,255,0002,113,536
5May 11, 2026 07:16112,777563,786,720549,604,0003,005,0002,113,536
6May 11, 2026 07:16115,358574,084,357561,991,0003,266,0002,113,536
7May 11, 2026 07:16115,395575,248,169562,435,0003,005,0002,113,536
8May 11, 2026 07:16115,624575,544,331563,295,0003,264,0002,113,536
9May 11, 2026 07:16115,909576,765,609564,944,0003,011,0002,113,536