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:47anboto1anboto1Score: 57,689Success
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:4957,592290,721,444281,155,0001,047,0002,113,536
2Aug 3, 2026 20:4957,630290,824,247281,284,0001,106,0002,113,536
3Aug 3, 2026 20:4957,682291,088,138281,456,0001,188,0002,113,536
4Aug 3, 2026 20:4957,684291,111,565281,455,0001,198,0002,113,536
5Aug 3, 2026 20:4957,689291,601,053281,497,0001,180,0002,113,536
6Aug 3, 2026 20:4957,936292,494,847282,752,0001,135,0002,113,536
7Aug 3, 2026 20:4957,938292,416,676282,898,0001,002,0002,113,536
8Aug 3, 2026 20:4958,000292,618,853283,088,0001,116,0002,113,536
9Aug 3, 2026 20:4958,015292,741,772283,159,0001,115,0002,113,536