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 listApr 22, 2025 16:14KeefeKeefeScore: 639,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 16:14638,9773,160,941,4783,128,991,0001,998,0002,269,184
2Apr 22, 2025 16:14639,0983,156,390,6763,130,579,000999,0002,269,184
3Apr 22, 2025 16:14639,1783,162,871,7883,131,971,00002,527,232
4Apr 22, 2025 16:14639,1843,169,651,2983,131,002,000999,0002,396,160
5Apr 22, 2025 16:14639,2253,167,070,6923,130,204,0001,998,0002,396,160
6Apr 22, 2025 16:14639,2753,158,255,1223,130,451,0001,998,0002,269,184
7Apr 22, 2025 16:14639,2753,156,113,6063,130,451,0001,998,0002,269,184
8Apr 22, 2025 16:14639,4643,159,753,2243,133,373,00002,269,184
9Apr 22, 2025 16:14639,6593,167,140,5693,132,331,0001,998,0002,269,184