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 listNov 15, 2024 05:36NoSIMD_C#NoSIMD_C#Score: 1,330,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 05:361,329,3446,548,184,2496,327,963,000185,822,0002,347,008
2Nov 15, 2024 05:361,330,2496,553,914,8756,390,372,000127,847,0002,306,048
3Nov 15, 2024 05:361,334,1276,573,794,3166,378,434,000158,786,0002,408,448