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 listMay 21, 2021 15:12Sergey StreminSergey StreminScore: 257,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2021 15:12193,2441,007,586,994946,893,26002,281,472
2May 21, 2021 15:12193,2591,015,937,261946,970,71102,273,280
3May 21, 2021 15:12193,2781,024,282,695947,060,85002,285,568
4May 21, 2021 15:12257,6271,323,583,6781,262,371,91002,281,472
5May 21, 2021 15:12257,9211,334,078,4901,263,814,15002,281,472
6May 21, 2021 15:12258,0641,326,826,6181,264,511,26402,281,472