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 15, 2026 15:06limanjun99limanjun99Score: 149,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 15:06147,950749,074,095721,954,0002,999,0002,265,088
2Mar 15, 2026 15:06148,147754,966,852724,922,000999,0002,289,664
3Mar 15, 2026 15:06148,565752,411,574725,968,0001,999,0002,289,664
4Mar 15, 2026 15:06149,442757,247,719730,266,0002,000,0002,387,968
5Mar 15, 2026 15:06149,512754,632,832729,610,0002,998,0002,289,664
6Mar 15, 2026 15:06151,077766,429,438738,279,0002,000,0002,289,664
7Mar 15, 2026 15:06151,139769,025,298738,581,0001,998,0002,289,664
8Mar 15, 2026 15:06152,260768,437,633744,076,0002,000,0002,289,664
9Mar 15, 2026 15:06152,380776,732,471744,663,0001,999,0002,289,664