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 listMar 4, 2026 17:04juniskewljuniskewlScore: 42,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 17:0442,898386,799,566355,054,0001,000,0002,293,760
2Mar 4, 2026 17:0442,907380,318,691354,130,0002,000,0002,285,568
3Mar 4, 2026 17:0442,932386,006,020354,341,0001,996,0002,293,760
4Mar 4, 2026 17:0442,937381,982,142354,381,0001,996,0002,293,760
5Mar 4, 2026 17:0442,960385,070,412355,572,000998,0002,363,392
6Mar 4, 2026 17:0442,985381,197,778355,776,000999,0002,293,760
7Mar 4, 2026 17:0443,008380,478,791354,970,0001,999,0002,273,280
8Mar 4, 2026 17:0443,008385,825,451354,969,0001,999,0002,273,280
9Mar 4, 2026 17:0443,039377,808,864356,220,0001,000,0002,269,184