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 listAug 2, 2026 21:40Josu San MartinJosu San MartinScore: 29,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 21:4029,650155,656,851144,159,0001,128,0002,113,536
2Aug 2, 2026 21:4029,659156,097,637144,208,0001,125,0002,113,536
3Aug 2, 2026 21:4029,666155,350,869144,249,0001,116,0002,113,536
4Aug 2, 2026 21:4029,668155,435,474144,241,0001,136,0002,113,536
5Aug 2, 2026 21:4029,671156,260,115144,256,0001,136,0002,113,536
6Aug 2, 2026 21:4029,711156,326,881144,451,0001,135,0002,113,536
7Aug 2, 2026 21:4029,729155,723,620144,540,0001,135,0002,113,536
8Aug 2, 2026 21:4029,869156,479,672144,226,0002,135,0002,113,536
9Aug 2, 2026 21:4029,900157,363,449145,371,0001,140,0002,113,536