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 23, 2024 14:01E SequeiraE SequeiraScore: 14,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 14:0114,232145,690,941117,126,0001,001,0002,465,792
2Nov 23, 2024 14:0114,233141,340,727116,133,0002,002,0002,306,048
3Nov 23, 2024 14:0114,233140,990,453116,128,0002,002,0002,289,664
4Nov 23, 2024 14:0114,235143,099,489116,151,0002,002,0002,482,176
5Nov 23, 2024 14:0114,239142,647,402116,178,0002,003,0002,478,080
6Nov 23, 2024 14:0114,241140,782,327116,199,0002,003,0002,465,792
7Nov 23, 2024 14:0114,245146,962,300116,232,0002,004,0002,289,664
8Nov 23, 2024 14:0114,255142,878,952117,313,0001,002,0002,289,664
9Nov 23, 2024 14:0114,310143,706,418117,774,000998,0002,473,984