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 listNov 11, 2024 08:21Anatoly ZhmurAnatoly ZhmurScore: 366,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 08:21364,5543,052,517,7782,918,877,000106,922,0002,494,464
2Nov 11, 2024 08:21365,0833,063,576,3692,935,280,00094,912,0002,355,200
3Nov 11, 2024 08:21366,0113,063,123,4932,946,958,00090,937,0002,355,200
4Nov 11, 2024 08:21366,0303,071,103,3302,931,117,000106,931,0002,355,200
5Nov 11, 2024 08:21366,1003,066,996,8262,910,730,000127,900,0002,387,968
6Nov 11, 2024 08:21366,3643,070,606,0712,937,898,000102,926,0002,355,200
7Nov 11, 2024 08:21369,7243,096,327,5602,961,793,000106,920,0002,498,560
8Nov 11, 2024 08:21370,2563,101,667,8892,977,187,00095,941,0002,433,024
9Nov 11, 2024 08:21373,9693,147,571,8262,984,179,000119,766,0002,355,200