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 listSep 28, 2026 19:30Karthik ReddyKarthik ReddyScore: 4,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 19:314,67649,138,05637,681,0001,137,0002,113,536
2Sep 28, 2026 19:314,70049,415,29937,882,0001,131,0002,113,536
3Sep 28, 2026 19:314,75649,822,16138,359,0001,124,0002,113,536
4Sep 28, 2026 19:314,81250,282,33738,814,0001,130,0002,113,536
5Sep 28, 2026 19:314,81550,402,36638,822,0001,146,0002,113,536
6Sep 28, 2026 19:314,82450,327,75538,905,0001,138,0002,113,536
7Sep 28, 2026 19:314,82850,418,80038,939,0001,134,0002,113,536
8Sep 28, 2026 19:314,84850,525,95639,082,0001,157,0002,113,536
9Sep 28, 2026 19:314,87850,839,24939,343,0001,147,0002,113,536