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 12, 2026 03:46Haha ExpertHaha ExpertScore: 157,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 03:47153,946764,705,943737,856,00016,484,0002,113,536
2Sep 12, 2026 03:47153,985770,367,553737,274,00017,256,00020,480
3Sep 12, 2026 03:47154,376767,458,574738,000,00018,447,00020,480
4Sep 12, 2026 03:47156,974780,228,548751,469,00017,705,00020,480
5Sep 12, 2026 03:47157,580782,566,867756,740,00015,406,0002,113,536
6Sep 12, 2026 03:47157,632782,710,613758,141,00014,259,00020,480
7Sep 12, 2026 03:47157,805783,895,926754,924,00018,325,0002,113,536
8Sep 12, 2026 03:47157,977785,117,605755,711,00018,377,00020,480
9Sep 12, 2026 03:47158,151786,020,799756,137,00018,806,00020,480