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 listJun 28, 2026 09:20Shikhar SoniShikhar SoniScore: 121,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:21120,827601,473,134589,981,0002,074,0002,113,536
2Jun 28, 2026 09:21121,096602,683,325591,363,0002,011,0002,113,536
3Jun 28, 2026 09:21121,145602,949,310591,579,0002,034,0002,113,536
4Jun 28, 2026 09:21121,189603,293,164591,755,0002,075,0002,113,536
5Jun 28, 2026 09:21121,528604,907,872593,424,0002,067,0002,113,536
6Jun 28, 2026 09:21121,801606,271,264594,751,0002,074,0002,113,536
7Jun 28, 2026 09:21122,456609,497,212597,986,0002,051,0002,113,536
8Jun 28, 2026 09:21122,662610,414,709599,029,0002,018,0002,113,536
9Jun 28, 2026 09:21123,389613,946,906602,510,0002,097,0002,113,536