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 31, 2026 18:51anboto1anboto1Score: 149,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:52149,052740,358,163729,271,0001,085,0002,113,536
2Jul 31, 2026 18:52149,088740,572,827729,293,0001,241,0002,113,536
3Jul 31, 2026 18:52149,169741,107,390729,825,0001,105,0002,113,536
4Jul 31, 2026 18:52149,182740,989,195729,928,0001,066,0002,113,536
5Jul 31, 2026 18:52149,210740,991,927730,069,0001,063,0002,113,536
6Jul 31, 2026 18:52149,235741,260,417730,174,0001,081,0002,113,536
7Jul 31, 2026 18:52149,435742,229,894731,160,0001,075,0002,113,536
8Jul 31, 2026 18:52149,499742,442,364731,480,0001,068,0002,113,536
9Jul 31, 2026 18:52149,517742,552,810731,543,0001,093,0002,113,536