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 listFeb 16, 2024 12:20Huy Duc LeHuy Duc LeScore: 12,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 12:2012,395160,573,277102,879,78302,293,760
2Feb 16, 2024 12:2012,413155,731,824103,023,95402,289,664
3Feb 16, 2024 12:2012,413171,276,385103,030,31202,297,856
4Feb 16, 2024 12:2012,527135,303,731103,974,00002,277,376
5Feb 16, 2024 12:2012,532134,394,040103,018,0001,000,0002,285,568
6Feb 16, 2024 12:2012,534136,629,977103,033,0001,000,0002,269,184
7Feb 16, 2024 12:2012,542132,392,110102,098,0002,001,0002,285,568
8Feb 16, 2024 12:2012,542127,219,588103,099,0001,000,0002,285,568
9Feb 16, 2024 12:2012,576132,701,810102,376,0002,007,0002,285,568
10Feb 16, 2024 12:2012,740131,419,910104,749,000997,0002,285,568
11Feb 16, 2024 12:2012,783131,919,155105,102,0001,000,0002,285,568
12Feb 16, 2024 12:2012,866132,502,445104,791,0001,996,0002,281,472