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:23M-RochatM-RochatScore: 113,266Success
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:24111,948557,913,571547,413,0001,135,0002,113,536
2May 18, 2026 01:24112,270561,320,093548,977,0001,149,0002,113,536
3May 18, 2026 01:24113,245565,304,924553,760,0001,141,0002,113,536
4May 18, 2026 01:24113,265564,719,983553,860,0001,140,0002,113,536
5May 18, 2026 01:24113,266566,419,479553,871,0001,135,0002,113,536
6May 18, 2026 01:24113,391565,051,802554,485,0001,135,0002,113,536
7May 18, 2026 01:24113,577568,655,585555,355,0001,173,0002,113,536
8May 18, 2026 01:24116,252581,373,799568,513,0001,124,0002,113,536
9May 18, 2026 01:24116,400581,512,892569,214,0001,148,0002,113,536