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 listJan 29, 2026 18:44lipapipalipapipaScore: 200,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 18:44199,9431,003,518,099978,723,000999,0002,510,848
2Jan 29, 2026 18:44199,9551,003,755,974977,782,0001,999,0002,269,184
3Jan 29, 2026 18:44200,0291,004,549,342979,141,0001,000,0002,510,848
4Jan 29, 2026 18:44200,0441,004,244,425980,216,00002,269,184
5Jan 29, 2026 18:44200,0541,007,200,889979,268,000999,0002,510,848
6Jan 29, 2026 18:44200,0651,011,629,439978,319,0001,998,0002,510,848
7Jan 29, 2026 18:44200,0671,012,878,421979,330,000999,0002,506,752
8Jan 29, 2026 18:44200,1001,005,358,925978,492,0001,998,0002,510,848
9Jan 29, 2026 18:44200,1421,003,301,418974,700,0005,998,0002,273,280