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 listOct 30, 2024 03:12Joad NacerJoad NacerScore: 251,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2024 03:12251,4911,255,367,2991,229,310,0002,998,0002,519,040
2Oct 30, 2024 03:12251,5131,256,083,8221,229,417,0002,998,0002,289,664
3Oct 30, 2024 03:12251,5161,260,220,4331,228,431,0003,998,0002,281,472
4Oct 30, 2024 03:12251,5341,258,007,8851,229,517,0002,998,0002,289,664
5Oct 30, 2024 03:12251,5451,260,183,1441,229,574,0002,998,0002,289,664
6Oct 30, 2024 03:12251,5821,260,006,3731,230,752,0001,999,0002,281,472
7Oct 30, 2024 03:12251,5851,254,353,1671,229,767,0002,999,0002,519,040
8Oct 30, 2024 03:12251,6561,257,328,5701,230,117,0002,997,0002,281,472
9Oct 30, 2024 03:12251,6821,255,630,7311,231,244,0001,998,0002,519,040