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 listMar 19, 2026 15:06Dominique GarmierDominique GarmierScore: 154,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 14:56152,511777,807,259743,308,0003,996,0002,338,816
2Mar 19, 2026 14:56153,373777,258,812747,533,0003,997,0002,519,040
3Mar 19, 2026 15:06153,610782,080,060748,693,0003,998,0002,342,912
4Mar 19, 2026 14:56154,162783,764,897752,395,0002,997,0002,523,136
5Mar 19, 2026 15:06154,665789,744,724753,860,0003,999,0002,342,912
6Mar 19, 2026 15:06155,659789,380,669758,729,0003,998,0002,314,240