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 14:07Kevin HeaveyKevin HeaveyScore: 52,020Success
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 14:3151,645263,166,921244,621,0008,441,00020,480
2Jul 27, 2026 14:3151,700264,170,850244,653,0008,681,00020,480
3Jul 27, 2026 14:3151,830267,013,319245,189,0008,778,00020,480
4Jul 27, 2026 14:3151,928264,534,801244,650,0009,800,00020,480
5Jul 27, 2026 14:3152,020264,999,968244,538,00010,361,00020,480
6Jul 27, 2026 14:3152,082275,072,510245,443,0009,760,00020,480
7Jul 27, 2026 14:3152,103265,371,915244,663,00010,643,00020,480
8Jul 27, 2026 14:3152,265266,209,013245,023,00011,078,00020,480
9Jul 27, 2026 14:3152,467267,166,495244,551,00012,539,00020,480