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 06:39Karthik 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 06:400376,969,642366,648,0001,190,0002,113,536expected "53689386633163405 ", got "2713 28 999|2604,57 2610,55 2605,56 2606,57 2611,57 2601,55 2601,55 2611,54 2606,55 2605,56 2613,57 2602,56 |2540|219 "
2Oct 2, 2026 06:400377,388,260367,208,0001,124,0002,113,536expected "53689607097452445 ", got "2744 27 999|2618,55 2611,53 2606,53 2605,54 2610,53 2602,53 2603,54 2610,52 2605,53 2605,54 2615,54 2602,53 |2535|73 "
3Oct 2, 2026 06:400376,600,269366,441,0001,127,0002,113,536expected "53686446882043997 ", got "2718 26 999|2600,54 2608,53 2602,53 2602,53 2610,54 2599,54 2606,54 2609,53 2603,53 2602,54 2609,55 2599,54 |2531|184 "