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 22, 2026 20:42M-RochatM-RochatScore: 111,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:43111,900558,049,401547,171,0001,139,0002,134,016
2May 22, 2026 20:43111,927558,302,035547,304,0001,143,0002,134,016
3May 22, 2026 20:43111,989561,663,604547,601,0001,148,0002,134,016
4May 22, 2026 20:43111,991560,173,898547,607,0001,152,0002,134,016
5May 22, 2026 20:43111,997561,656,151547,632,0001,156,0002,134,016
6May 22, 2026 20:43112,019560,818,439547,752,0001,145,0002,134,016
7May 22, 2026 20:43112,023562,697,989547,764,0001,150,0002,134,016
8May 22, 2026 20:43112,085563,168,704547,053,0002,166,0002,134,016
9May 22, 2026 20:43112,090559,572,830547,069,0002,172,0002,134,016