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 1, 2026 04:55anboto1anboto1Score: 163,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 04:56163,651812,056,620800,472,0001,421,0002,113,536
2Aug 1, 2026 04:56163,705812,377,658800,735,0001,422,0002,113,536
3Aug 1, 2026 04:56163,723812,530,522800,191,0002,052,0002,113,536
4Aug 1, 2026 04:56163,740812,522,614800,913,0001,414,0002,113,536
5Aug 1, 2026 04:56163,894814,054,558801,662,0001,422,0002,113,536
6Aug 1, 2026 04:56164,024813,941,256801,589,0002,130,0002,113,536
7Aug 1, 2026 04:56164,057814,139,639802,452,0001,429,0002,113,536
8Aug 1, 2026 04:56164,080814,267,487802,578,0001,417,0002,113,536
9Aug 1, 2026 04:56164,177814,658,534803,050,0001,419,0002,113,536