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 1, 2026 21:11CodeReclaimersCodeReclaimersScore: 69,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 1, 2026 21:1169,402350,188,770338,963,0001,107,0002,113,536
2Aug 1, 2026 21:1169,432350,430,906339,113,0001,106,0002,113,536
3Aug 1, 2026 21:1169,468351,324,675339,283,0001,115,0002,113,536
4Aug 1, 2026 21:1169,611351,154,346339,995,0001,101,0002,113,536
5Aug 1, 2026 21:1169,671351,598,999340,265,0001,124,0002,113,536
6Aug 1, 2026 21:1169,742351,914,523340,617,0001,122,0002,113,536
7Aug 1, 2026 21:1169,748351,966,996340,644,0001,122,0002,113,536
8Aug 1, 2026 21:1169,753352,621,970340,667,0001,125,0002,113,536
9Aug 1, 2026 21:1169,775352,772,129340,785,0001,114,0002,113,536