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 18, 2025 04:50Chandrasekaran AkashChandrasekaran AkashScore: 1,116,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 04:501,116,1605,499,223,2935,457,193,00011,993,000184,320
2Apr 18, 2025 04:501,116,5345,499,481,2785,459,022,00011,993,000184,320
3Apr 18, 2025 04:501,119,2555,513,975,2055,474,353,0009,995,000184,320