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 20, 2026 13:51Dominique GarmierDominique GarmierScore: 88,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 13:5087,124750,649,665722,130,0001,000,0002,494,464
2Mar 20, 2026 13:5187,403753,157,419723,448,0001,998,0002,265,088
3Mar 20, 2026 13:5087,540756,716,050723,588,0002,998,0002,490,368
4Mar 20, 2026 13:5088,057758,790,087728,872,0001,999,0002,273,280
5Mar 20, 2026 13:5189,090771,358,475739,451,00002,404,352
6Mar 20, 2026 13:5191,071785,119,341753,887,0001,999,0002,490,368