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 22:12anboto1anboto1Score: 69,125Success
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 22:1269,018346,615,678337,108,0001,082,0002,113,536
2Aug 3, 2026 22:1269,066346,873,915337,322,0001,105,0002,113,536
3Aug 3, 2026 22:1269,075347,619,379337,368,0001,103,0002,113,536
4Aug 3, 2026 22:1269,090347,005,464337,391,0001,154,0002,113,536
5Aug 3, 2026 22:1269,125347,069,796337,622,0001,092,0002,113,536
6Aug 3, 2026 22:1269,250347,937,703338,219,0001,106,0002,113,536
7Aug 3, 2026 22:1269,376349,083,890338,792,0001,154,0002,113,536
8Aug 3, 2026 22:1269,442348,705,714339,165,0001,105,0002,113,536
9Aug 3, 2026 22:1270,245352,776,746342,996,0001,206,0002,113,536