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 18:50Karthik 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 18:50045,861,02731,139,0005,669,00024,576expected "53682304568990812 ", got "popX 219634 popY 184658 ; hotY 2361 ; stream 30155 ; coldY 3888 coldX 5750 ; restX 91793 x10ns s0 "
2Oct 2, 2026 18:50046,905,61430,566,0005,916,00024,576expected "53689710888538551 ", got "popX 206718 popY 173518 ; hotY 2549 ; stream 30342 ; coldY 4168 coldX 5742 ; restX 79897 x10ns s0 "
3Oct 2, 2026 18:50045,768,31331,114,0005,627,00024,576expected "53694052152641278 ", got "popX 219864 popY 184989 ; hotY 2549 ; stream 30172 ; coldY 4040 coldX 5655 ; restX 85988 x10ns s1 "