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 listOct 2, 2026 12:20Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 12:210503,056,687492,910,0001,108,0002,113,536expected "53684686431345494 ", got "2590 2426 2443 2494 2939 2990 2564 2480 2485 2425 2481 2538 2978 2826 2614 2524 2458 2495 2424 71 "
2Oct 2, 2026 12:210502,505,489492,201,0001,169,0002,113,536expected "53687560757937249 ", got "2596 2420 2438 2490 2940 2985 2560 2476 2479 2435 2474 2533 2975 2821 2612 2517 2454 2492 2419 20 "
3Oct 2, 2026 12:210503,532,703493,339,0001,156,0002,113,536expected "53683412515635312 ", got "2597 2428 2445 2496 2941 2989 2569 2486 2487 2429 2483 2540 2978 2829 2616 2528 2459 2498 2427 68 "