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 listFeb 3, 2026 22:04olliecrowolliecrowScore: 174,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 22:04174,016881,075,584850,680,0001,999,0002,277,376
2Feb 3, 2026 22:04174,067874,609,008851,929,000999,0002,277,376
3Feb 3, 2026 22:04174,150879,793,809850,339,0002,997,0002,277,376
4Feb 3, 2026 22:04174,218879,620,715851,669,0001,999,0002,387,968
5Feb 3, 2026 22:04174,300880,134,848853,069,0001,000,0002,277,376
6Feb 3, 2026 22:04174,313874,426,467851,139,0002,996,0002,379,776
7Feb 3, 2026 22:04175,559886,624,043858,241,0002,000,0002,277,376
8Feb 3, 2026 22:04175,561883,335,987857,252,0002,997,0002,502,656
9Feb 3, 2026 22:04175,583881,145,754857,362,0002,997,0002,273,280