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 3, 2025 14:55Rajarshi BasuRajarshi BasuScore: 11,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 14:5511,607119,912,04895,338,0001,003,0002,289,664
2Dec 3, 2025 14:5511,629127,859,25395,516,0001,005,0002,490,368
3Dec 3, 2025 14:5511,644123,551,74094,653,0001,992,0002,289,664
4Dec 3, 2025 14:5511,655120,390,01595,742,000997,0002,289,664
5Dec 3, 2025 14:5511,656121,274,28794,750,0001,994,0002,289,664
6Dec 3, 2025 14:5511,656124,646,97995,751,000997,0002,285,568
7Dec 3, 2025 14:5511,657122,681,93295,757,000997,0002,289,664
8Dec 3, 2025 14:5511,671120,264,46294,872,0001,997,0002,289,664
9Dec 3, 2025 14:5511,724123,076,21895,302,0002,006,0002,289,664
10Dec 3, 2025 14:5511,783127,525,72795,803,0001,995,0002,494,464
11Dec 3, 2025 14:5511,868120,699,52398,502,00002,359,296
12Dec 3, 2025 14:5511,897125,775,31197,747,000997,0002,289,664