Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 22, 2026 08:30Victor MerckléVictor MerckléScore: 4,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 08:314,56545,731,33536,808,0001,087,0002,117,632stderr
2May 22, 2026 08:314,56645,958,57436,829,0001,076,0002,117,632stderr
3May 22, 2026 08:314,56847,773,95836,832,0001,088,0002,117,632stderr
4May 22, 2026 08:314,57645,812,04236,889,0001,097,0002,117,632stderr
5May 22, 2026 08:314,58845,947,80637,048,0001,040,0002,117,632stderr
6May 22, 2026 08:314,59546,488,36137,138,0001,006,0002,117,632stderr
7May 22, 2026 08:314,60646,046,25237,232,0001,001,0002,117,632stderr
8May 22, 2026 08:314,60749,205,50437,239,0001,003,0002,117,632stderr
9May 22, 2026 08:314,62346,154,91537,346,0001,028,0002,117,632stderr