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:57anboto1anboto1Score: 59,169Success
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:5858,974297,441,084287,881,0001,096,0002,113,536
2Aug 3, 2026 21:5858,996297,622,657288,025,0001,060,0002,113,536
3Aug 3, 2026 21:5859,007297,590,176288,114,0001,023,0002,113,536
4Aug 3, 2026 21:5859,072297,924,985288,425,0001,031,0002,113,536
5Aug 3, 2026 21:5859,169298,334,444288,872,0001,060,0002,113,536
6Aug 3, 2026 21:5859,268298,883,752289,395,0001,023,0002,113,536
7Aug 3, 2026 21:5859,283298,873,221289,463,0001,025,0002,113,536
8Aug 3, 2026 21:5859,284298,922,483289,405,0001,088,0002,113,536
9Aug 3, 2026 21:5859,489300,575,690290,472,0001,026,0002,113,536