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 listApr 4, 2026 03:12limanjun99limanjun99Score: 120,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2026 03:12119,957612,680,468585,791,0001,999,0002,293,760
2Apr 4, 2026 03:12119,966616,112,731584,835,0002,999,0002,273,280
3Apr 4, 2026 03:12119,979614,061,579585,897,0001,999,0002,269,184
4Apr 4, 2026 03:12120,014617,961,637585,069,0003,000,0002,293,760
5Apr 4, 2026 03:12120,229615,789,405587,122,0002,000,0002,293,760
6Apr 4, 2026 03:12120,480615,443,631589,351,0001,000,0002,277,376
7Apr 4, 2026 03:12120,484613,179,738587,375,0002,996,0002,293,760
8Apr 4, 2026 03:12120,515615,929,183587,528,0002,997,0002,293,760
9Apr 4, 2026 03:12120,782619,883,552588,834,0002,999,0002,527,232