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:04Karthik 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:040401,162,013390,981,0001,147,0002,113,536expected "53683505313300696 ", got "2591 2977 3022 2758 2840 2990 2779 2440 2478 2999 2762 2962 2438 2979 225 "
2Oct 2, 2026 15:040401,205,863390,903,0001,114,0002,113,536expected "53684445162784028 ", got "2595 2976 3022 2759 2838 2990 2769 2439 2481 3010 2773 2956 2440 2948 245 "
3Oct 2, 2026 15:040401,641,851391,548,0001,023,0002,113,536expected "53681037235700943 ", got "2599 2981 3004 2764 2843 2994 2771 2445 2487 3001 2768 2973 2449 2979 248 "