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 listDec 31, 2025 13:50Aniruddha DebAniruddha DebScore: 166,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 13:50163,551825,216,359799,402,0001,998,0002,531,328
2Dec 31, 2025 13:50164,413827,489,218803,625,0001,999,0002,510,848
3Dec 31, 2025 13:50164,859831,174,668805,812,0001,999,0002,273,280
4Dec 31, 2025 13:50165,449834,101,987809,700,000999,0002,273,280
5Dec 31, 2025 13:50166,762837,994,887817,134,00002,273,280
6Dec 31, 2025 13:50169,511853,653,883829,605,000999,0002,273,280
7Dec 31, 2025 13:50170,042862,996,191832,204,0001,000,0002,531,328
8Dec 31, 2025 13:50170,551855,782,331833,701,0001,999,0002,420,736
9Dec 31, 2025 13:50173,531874,949,328849,302,000999,0002,273,280