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 4, 2026 00:49Josu San MartinJosu San MartinScore: 35,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 00:5034,934179,652,066170,173,0001,007,0002,113,536
2Aug 4, 2026 00:5034,978179,843,823170,394,0001,002,0002,113,536
3Aug 4, 2026 00:5035,068180,248,863170,644,0001,190,0002,113,536
4Aug 4, 2026 00:5035,239181,058,572171,478,0001,197,0002,113,536
5Aug 4, 2026 00:5035,252181,151,556171,546,0001,190,0002,113,536
6Aug 4, 2026 00:5035,264181,805,331171,616,0001,179,0002,113,536
7Aug 4, 2026 00:5035,412181,909,794172,356,0001,166,0002,113,536
8Aug 4, 2026 00:5035,440182,750,984172,457,0001,203,0002,113,536
9Aug 4, 2026 00:5035,455182,132,640172,705,0001,026,0002,113,536