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 28, 2026 00:20Kevin HeaveyKevin HeaveyScore: 125,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2026 08:01120,438600,192,503577,658,00012,489,0002,113,536
2Jul 28, 2026 08:01120,599600,944,478578,484,00012,453,0002,113,536
3Jul 28, 2026 08:01122,436609,920,894587,200,00012,738,0002,113,536
4Jul 28, 2026 08:01125,725626,081,194584,235,00031,820,00020,480
5Jul 28, 2026 08:01125,953627,292,690584,822,00032,351,0002,113,536
6Jul 28, 2026 08:01126,781631,312,127589,640,00031,591,00020,480
7Jul 28, 2026 08:01127,289634,576,485591,818,00031,900,00020,480
8Jul 28, 2026 08:01127,348634,117,937590,617,00033,390,0002,113,536
9Jul 28, 2026 08:01128,336640,993,140586,893,00041,958,0002,113,536