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 listJul 17, 2025 00:56zielajzielajScore: 37,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2025 00:5637,363205,079,857182,079,0001,000,0002,461,696
2Jul 17, 2025 00:5637,364208,751,889181,086,0002,000,0002,461,696
3Jul 17, 2025 00:5637,367203,869,065182,097,0001,000,0002,293,760
4Jul 17, 2025 00:5637,375206,566,627181,138,0002,001,0002,445,312
5Jul 17, 2025 00:5637,390205,526,584182,212,0001,001,0002,445,312
6Jul 17, 2025 00:5637,475210,428,312182,629,000997,0002,322,432
7Jul 17, 2025 00:5638,348211,741,768186,905,000999,0002,314,240
8Jul 17, 2025 00:5638,377212,696,065185,047,0003,000,0002,453,504
9Jul 17, 2025 00:5638,408209,565,356187,200,0001,001,0002,461,696