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 listSep 11, 2026 15:16Haha ExpertHaha ExpertScore: 168,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 15:21164,420816,779,564776,075,00029,585,00020,480
2Sep 11, 2026 15:21164,556817,375,341775,630,00030,698,00020,480
3Sep 11, 2026 15:21167,639833,264,153783,857,00037,575,00020,480
4Sep 11, 2026 15:21167,911833,812,123792,992,00029,772,00020,480
5Sep 11, 2026 15:21168,231834,829,789794,619,00029,715,00020,480
6Sep 11, 2026 15:21168,683838,199,601794,672,00031,875,00020,480
7Sep 11, 2026 15:21168,708837,733,475796,187,00030,484,00020,480
8Sep 11, 2026 15:21169,393841,457,605792,943,00037,085,00020,480
9Sep 11, 2026 15:21169,936843,751,209794,474,00038,217,00020,480