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 listMar 8, 2026 15:54SneedSneedScore: 2,890,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 15:542,866,84114,079,391,14313,924,580,000122,943,0002,285,568
2Mar 8, 2026 15:542,869,37514,094,022,27613,939,997,000119,939,0002,260,992
3Mar 8, 2026 15:542,871,42414,104,985,14213,927,041,000142,938,0002,277,376
4Mar 8, 2026 15:542,885,54714,170,451,73914,017,230,000121,949,0002,277,376
5Mar 8, 2026 15:542,890,98014,197,650,31314,061,850,000103,954,0002,265,088
6Mar 8, 2026 15:542,913,38414,308,570,92114,150,654,000124,926,0002,277,376
7Mar 8, 2026 15:542,922,88814,358,886,79314,178,219,000143,931,0002,277,376
8Mar 8, 2026 15:542,944,80914,465,518,91014,296,644,000132,922,0002,277,376
9Mar 8, 2026 15:542,967,04114,572,847,87314,407,578,000130,923,0002,277,376