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 00:04A_ShamanA_ShamanScore: 151,951Success
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 00:05151,920754,816,792741,309,0003,100,0002,125,824
2Jun 28, 2026 00:05151,923756,389,040741,391,0003,032,0002,125,824
3Jun 28, 2026 00:05151,928754,639,687741,347,0003,101,0002,125,824
4Jun 28, 2026 00:05151,948754,589,766741,401,0003,145,0002,125,824
5Jun 28, 2026 00:05151,951755,058,359741,449,0003,111,0002,125,824
6Jun 28, 2026 00:05151,965754,695,736741,498,0003,132,0002,125,824
7Jun 28, 2026 00:05151,976755,114,388741,578,0003,105,0002,125,824
8Jun 28, 2026 00:05151,982754,673,173741,579,0003,136,0002,125,824
9Jun 28, 2026 00:05151,987755,081,512741,632,0003,107,0002,125,824