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:29anboto1anboto1Score: 57,933Success
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:3057,651290,902,934281,387,0001,105,0002,113,536
2Aug 3, 2026 20:3057,670291,045,290281,480,0001,107,0002,113,536
3Aug 3, 2026 20:3057,718291,329,300281,686,0001,135,0002,113,536
4Aug 3, 2026 20:3057,892292,120,070282,563,0001,111,0002,113,536
5Aug 3, 2026 20:3057,933293,819,961282,807,0001,065,0002,113,536
6Aug 3, 2026 20:3057,963292,450,587282,904,0001,116,0002,113,536
7Aug 3, 2026 20:3058,068293,069,955283,350,0001,188,0002,113,536
8Aug 3, 2026 20:3058,092293,196,374283,450,0001,201,0002,113,536
9Aug 3, 2026 20:3059,398299,568,830289,939,0001,115,0002,113,536