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 listJan 12, 2026 10:09Petsku01Petsku01Score: 462,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 10:09461,8652,289,370,3632,046,317,000216,821,0002,510,848
2Jan 12, 2026 10:09461,8842,294,358,7652,044,402,000218,829,0002,519,040
3Jan 12, 2026 10:09462,0362,289,009,3052,054,071,000209,905,0002,523,136
4Jan 12, 2026 10:09462,1682,288,885,8132,050,754,000213,870,0002,490,368
5Jan 12, 2026 10:09462,2162,295,573,5712,049,966,000214,891,0002,408,448
6Jan 12, 2026 10:09462,3212,296,194,9682,052,525,000212,847,0002,265,088
7Jan 12, 2026 10:09462,7602,293,126,7422,045,671,000221,855,0002,265,088
8Jan 12, 2026 10:09463,6912,298,707,0442,064,263,000207,825,0002,449,408
9Jan 12, 2026 10:09464,1012,301,740,3822,056,276,000217,817,0002,281,472