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 listDec 23, 2025 05:44Josu San MartinJosu San MartinScore: 248,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 05:44242,7141,220,283,6591,184,301,0004,997,0002,314,240
2Dec 23, 2025 05:36242,7211,221,510,9061,185,334,0003,997,0002,301,952
3Dec 23, 2025 05:36244,2941,223,697,9931,194,042,0002,997,0002,322,432
4Dec 23, 2025 05:44248,5691,247,590,8621,213,991,0003,996,0002,318,336
5Dec 23, 2025 05:36252,0721,264,223,9511,231,158,0003,997,0002,310,144
6Dec 23, 2025 05:44253,6031,268,872,8341,239,656,0002,999,0002,281,472