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 31, 2026 21:59anboto1anboto1Score: 130,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 22:07128,595640,337,475628,985,0001,133,0002,113,536
2Jul 31, 2026 22:07128,817641,483,863630,080,0001,126,0002,113,536
3Jul 31, 2026 22:07128,822641,452,767630,098,0001,132,0002,113,536
4Jul 31, 2026 22:07130,038648,588,936636,083,0001,108,0002,113,536
5Jul 31, 2026 22:07130,176647,976,328636,731,0001,136,0002,113,536
6Jul 31, 2026 22:07130,366648,971,586637,672,0001,125,0002,113,536
7Jul 31, 2026 22:07131,421654,845,321642,827,0001,137,0002,113,536
8Jul 31, 2026 22:07131,664655,312,356644,048,0001,110,0002,113,536
9Jul 31, 2026 22:07132,700660,432,994649,122,0001,110,0002,117,632