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 24, 2026 15:42Andrew EpsteinAndrew EpsteinScore: 239,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 15:43239,5721,184,439,4851,172,798,0001,108,0002,117,632stderr
2Sep 24, 2026 15:43239,6871,185,002,6771,173,362,0001,109,0002,117,632stderr
3Sep 24, 2026 15:43239,8341,185,774,8291,174,082,0001,109,0002,117,632stderr
4Sep 24, 2026 15:43239,8481,186,398,3111,173,993,0001,267,0002,117,632stderr
5Sep 24, 2026 15:43239,9121,186,084,9241,174,457,0001,116,0002,117,632stderr
6Sep 24, 2026 15:43239,9621,186,569,3791,173,639,0002,178,0002,117,632stderr
7Sep 24, 2026 15:43240,0141,186,695,3161,174,952,0001,119,0002,117,632stderr
8Sep 24, 2026 15:43240,5251,189,171,6701,177,459,0001,117,0002,117,632stderr
9Sep 24, 2026 15:43240,6671,189,795,2941,178,161,0001,110,0002,117,632stderr