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 3, 2026 20:43anboto1anboto1Score: 57,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:4557,574291,254,768281,005,0001,112,0002,113,536
2Aug 3, 2026 20:4557,669292,403,567281,317,0001,263,0002,113,536
3Aug 3, 2026 20:4557,680291,593,860281,548,0001,087,0002,113,536
4Aug 3, 2026 20:4557,684291,123,002281,546,0001,106,0002,113,536
5Aug 3, 2026 20:4557,690291,692,083281,525,0001,159,0002,113,536
6Aug 3, 2026 20:4557,714291,326,181281,610,0001,190,0002,113,536
7Aug 3, 2026 20:4557,799298,652,630282,139,0001,079,0002,113,536
8Aug 3, 2026 20:4558,723296,305,050286,561,0001,183,0002,113,536
9Aug 3, 2026 20:4558,987297,533,134287,939,0001,100,0002,113,536