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 listApr 23, 2026 00:19olliecrowolliecrowError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 00:19017,811,30801,411,0002,383,872expected "560376999127 ", got "102221432 "
2Apr 23, 2026 00:19020,025,25801,410,0002,387,968expected "560382493238 ", got "3667426796 "
3Apr 23, 2026 00:19014,680,53501,425,0002,482,176expected "560372568184 ", got "3183571465 "