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 listSep 23, 2026 22:17Kevin HeaveyKevin HeaveyScore: 24,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 22:1824,696129,782,209119,955,0001,060,00020,480
2Sep 23, 2026 22:1824,708129,795,728120,014,0001,059,00020,480
3Sep 23, 2026 22:1824,714129,866,663120,053,0001,046,00020,480
4Sep 23, 2026 22:1824,715129,936,819120,045,0001,061,00020,480
5Sep 23, 2026 22:1824,715129,839,569120,064,0001,041,00020,480
6Sep 23, 2026 22:1824,716129,907,563120,058,0001,055,00020,480
7Sep 23, 2026 22:1824,719129,904,207120,078,0001,047,00020,480
8Sep 23, 2026 22:1824,724129,767,154120,083,0001,066,00020,480
9Sep 23, 2026 22:1824,851130,616,630120,714,0001,056,00020,480