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 18:36Dominique GarmierDominique GarmierScore: 168,448Success
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 19:17166,000839,942,544812,402,000999,0002,486,272
2Mar 19, 2026 18:36166,494843,782,212813,823,0001,999,0002,482,176
3Mar 19, 2026 19:17167,507850,107,288818,785,0001,999,0002,347,008
4Mar 19, 2026 18:36168,448852,984,258822,399,0002,997,0002,424,832
5Mar 19, 2026 19:17169,238860,570,932828,265,000999,0002,420,736
6Mar 19, 2026 18:36169,276859,900,806827,453,0001,998,0002,482,176