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 listJan 23, 2026 16:38Josu San MartinJosu San MartinScore: 85,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 16:3885,888445,994,533418,854,0001,999,0002,273,280
2Jan 23, 2026 16:3885,893449,424,558418,878,0001,999,0002,383,872
3Jan 23, 2026 16:3885,951451,499,126420,158,0001,000,0002,387,968
4Jan 23, 2026 16:3885,957444,071,434417,187,0004,001,0002,269,184
5Jan 23, 2026 16:3885,982448,120,006421,313,00002,273,280
6Jan 23, 2026 16:3886,616447,547,368422,416,0002,001,0002,396,160