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 listSep 23, 2026 14:04Kevin HeaveyKevin HeaveyScore: 37,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 14:0537,320193,284,261181,747,0001,125,00020,480
2Sep 23, 2026 14:0537,333194,390,003181,838,0001,097,00020,480
3Sep 23, 2026 14:0537,352193,505,082181,926,0001,102,00020,480
4Sep 23, 2026 14:0537,395194,369,162182,100,0001,136,00020,480
5Sep 23, 2026 14:0537,407193,798,847182,166,0001,133,00020,480
6Sep 23, 2026 14:0537,456194,054,908182,428,0001,111,00020,480
7Sep 23, 2026 14:0537,554195,220,148182,902,0001,117,00020,480
8Sep 23, 2026 14:0537,560194,423,489182,943,0001,101,00020,480
9Sep 23, 2026 14:0537,565194,559,141182,959,0001,114,00020,480