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 27, 2026 15:09Kevin HeaveyKevin HeaveyScore: 62,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 15:3762,238315,775,754303,422,0001,545,00020,480
2Jul 27, 2026 15:3762,344316,188,664303,930,0001,556,00020,480
3Jul 27, 2026 15:3762,358315,599,511303,898,0001,660,00020,480
4Jul 27, 2026 15:3762,398315,809,520303,960,0001,791,00020,480
5Jul 27, 2026 15:3762,401316,551,896304,095,0001,673,00020,480
6Jul 27, 2026 15:3762,404315,838,385303,987,0001,797,00020,480
7Jul 27, 2026 15:3762,446316,032,266304,447,0001,542,00020,480
8Jul 27, 2026 15:3762,492316,400,941303,491,0002,723,0002,113,536
9Jul 27, 2026 15:3762,737317,583,817305,744,0001,669,00020,480