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:09limanjun99limanjun99Score: 120,358Success
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:09119,963613,042,676585,820,0001,999,0002,293,760
2Apr 4, 2026 03:09119,969613,833,904585,848,0001,999,0002,273,280
3Apr 4, 2026 03:09120,060616,458,689585,297,0002,996,0002,273,280
4Apr 4, 2026 03:09120,320611,465,359586,570,0002,997,0002,293,760
5Apr 4, 2026 03:09120,358614,195,357587,753,0001,999,0002,293,760
6Apr 4, 2026 03:09120,390617,224,534587,912,0001,999,0002,269,184
7Apr 4, 2026 03:09120,416614,078,434587,039,0003,000,0002,265,088
8Apr 4, 2026 03:09120,513616,229,480587,518,0002,997,0002,293,760
9Apr 4, 2026 03:09120,594617,175,251588,913,0001,999,0002,293,760