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 listDec 9, 2025 11:01Gunsoo KimGunsoo KimScore: 59,250Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 11:0159,226517,653,224490,580,000999,0002,289,664
2Dec 9, 2025 11:0159,244517,315,459489,726,0001,998,0002,285,568
3Dec 9, 2025 11:0159,244520,322,118489,731,0001,998,0002,269,184
4Dec 9, 2025 11:0159,247518,602,775490,747,000999,0002,289,664
5Dec 9, 2025 11:0159,250518,446,803490,772,000999,0002,289,664
6Dec 9, 2025 11:0159,274519,131,950489,979,0001,999,0002,289,664
7Dec 9, 2025 11:0159,285521,339,507490,067,0002,000,0002,285,568
8Dec 9, 2025 11:0159,287512,683,216491,084,0001,000,0002,289,664
9Dec 9, 2025 11:0159,309519,644,307492,265,00002,289,664