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 11:38Karthik 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 11:380217,636,683207,535,0001,061,0002,113,536expected "53682675580768945 ", got "2589 2595 2569 2596 2569 2595 2569 2595 "
2Oct 2, 2026 11:380218,173,531208,068,0001,060,0002,113,536expected "53688668982223188 ", got "2601 2594 2584 2593 2585 2595 2582 2594 "
3Oct 2, 2026 11:380218,243,664208,156,0001,003,0002,113,536expected "53681906881861117 ", got "2595 2595 2606 2594 2580 2593 2578 2593 "