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 listJul 4, 2026 04:01zielajzielajScore: 24,483Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 04:0224,408128,004,165117,505,0002,098,0002,121,728stderr
2Jul 4, 2026 04:0224,446127,790,456117,772,0002,018,0002,121,728stderr
3Jul 4, 2026 04:0224,449127,758,859117,642,0002,160,0002,121,728stderr
4Jul 4, 2026 04:0224,475128,008,958117,859,0002,071,0002,121,728stderr
5Jul 4, 2026 04:0224,483127,927,211117,913,0002,055,0002,121,728stderr
6Jul 4, 2026 04:0224,498128,010,893117,945,0002,098,0002,121,728stderr
7Jul 4, 2026 04:0224,549128,683,694118,111,0002,183,0002,121,728stderr
8Jul 4, 2026 04:0225,162131,391,080121,256,0002,039,0002,121,728stderr
9Jul 4, 2026 04:0226,167136,192,118126,209,0002,010,0002,121,728stderr