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 29, 2026 16:16olliecrowolliecrowScore: 205,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 16:16205,2781,025,575,0241,003,864,0001,999,0002,330,624
2Apr 29, 2026 16:16205,5821,026,794,9901,005,356,0001,998,0002,314,240
3Apr 29, 2026 16:16206,5601,032,479,4091,010,148,0001,998,0002,318,336