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 13, 2025 00:10Miguel Rodrigues Carrilho BorgesMiguel Rodrigues Carrilho BorgesScore: 58,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2025 00:0758,843520,744,917487,401,0001,000,0002,281,472
2Feb 13, 2025 00:1058,845519,838,505487,412,0001,000,0002,289,664
3Feb 13, 2025 00:0758,874513,867,068487,656,000999,0002,273,280
4Feb 13, 2025 00:0758,952516,540,118488,299,0001,000,0002,289,664
5Feb 13, 2025 00:0758,953517,888,868488,313,0001,000,0002,281,472
6Feb 13, 2025 00:0758,961516,331,581488,379,0001,000,0002,293,760
7Feb 13, 2025 00:0758,962519,556,919488,384,0001,000,0002,269,184
8Feb 13, 2025 00:0758,964518,094,858488,404,0001,000,0002,289,664
9Feb 13, 2025 00:0758,965515,646,348489,409,00002,265,088
10Feb 13, 2025 00:0758,969519,056,660488,439,0001,000,0002,523,136
11Feb 13, 2025 00:1058,970522,684,118488,448,0001,000,0002,273,280
12Feb 13, 2025 00:1059,024513,784,982487,901,0001,999,0002,281,472