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 15:28Karthik 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 15:280312,923,324302,877,0001,042,0002,113,536expected "53693617413793693 ", got "2552 2516 2513 2513 2523 2514 2508 2515 2512 2514 2524 2513 144 "
2Oct 2, 2026 15:280313,544,337303,523,0001,009,0002,113,536expected "53693497597989950 ", got "2537 2522 2522 2519 2528 2520 2515 2524 2521 2519 2528 2520 86 "
3Oct 2, 2026 15:280313,223,570303,255,0001,010,0002,113,536expected "53684773234318578 ", got "2538 2518 2517 2517 2526 2518 2511 2519 2520 2519 2528 2517 2 "