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,992Success
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:1257,522290,415,610280,766,0001,092,0002,113,536
2Aug 3, 2026 21:1257,542290,441,193280,782,0001,178,0002,113,536
3Aug 3, 2026 21:1257,593290,673,279281,128,0001,078,0002,113,536
4Aug 3, 2026 21:1257,611290,709,040281,202,0001,096,0002,113,536
5Aug 3, 2026 21:1257,992292,676,490283,072,0001,093,0002,113,536
6Aug 3, 2026 21:1258,233293,801,452284,225,0001,119,0002,113,536
7Aug 3, 2026 21:1258,714296,614,781286,612,0001,091,0002,113,536
8Aug 3, 2026 21:1259,043297,840,977288,153,0001,159,0002,113,536
9Aug 3, 2026 21:1259,140298,851,854288,701,0001,087,0002,113,536