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 21:10anboto1anboto1Score: 57,610Success
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 21:1157,550291,110,418280,829,0001,169,0002,113,536
2Aug 3, 2026 21:1157,574290,970,360281,023,0001,093,0002,113,536
3Aug 3, 2026 21:1157,577291,189,420280,995,0001,137,0002,113,536
4Aug 3, 2026 21:1157,607290,985,301281,162,0001,113,0002,113,536
5Aug 3, 2026 21:1157,610291,368,020281,203,0001,090,0002,113,536
6Aug 3, 2026 21:1157,684291,134,648281,488,0001,167,0002,113,536
7Aug 3, 2026 21:1158,797296,648,630286,946,0001,162,0002,113,536
8Aug 3, 2026 21:1159,034297,731,523288,171,0001,098,0002,113,536
9Aug 3, 2026 21:1159,348299,882,454289,713,0001,094,0002,113,536