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 12:45Kevin HeaveyKevin HeaveyScore: 57,309Success
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 12:5556,925288,927,593268,058,00010,875,00020,480
2Jul 27, 2026 12:5556,962289,103,844267,992,00011,126,00020,480
3Jul 27, 2026 12:5557,204291,055,951268,947,00011,355,00020,480
4Jul 27, 2026 12:5557,298290,821,278268,233,00012,530,00020,480
5Jul 27, 2026 12:5557,309292,691,352268,070,00012,746,00020,480
6Jul 27, 2026 12:5557,373291,203,259268,285,00012,847,00020,480
7Jul 27, 2026 12:5557,396291,301,564268,220,00013,022,00020,480
8Jul 27, 2026 12:5557,469291,675,645268,134,00013,465,00020,480
9Jul 27, 2026 12:5557,521292,530,689268,807,00013,050,00020,480