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 28, 2024 23:36Hayden DonnellyHayden DonnellyScore: 72,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 23:3672,715628,250,450601,536,0001,998,0002,289,664
2Nov 28, 2024 23:3672,720628,470,381603,575,00002,277,376
3Nov 28, 2024 23:3672,729624,496,025601,656,0001,998,0002,277,376
4Nov 28, 2024 23:3672,731627,503,558601,666,0001,998,0002,277,376
5Nov 28, 2024 23:3672,738627,701,849601,723,0001,999,0002,531,328
6Nov 28, 2024 23:3672,740631,492,026602,739,000999,0002,285,568
7Nov 28, 2024 23:3672,745631,412,025602,782,000999,0002,285,568
8Nov 28, 2024 23:3672,749628,072,140601,814,0001,999,0002,285,568
9Nov 28, 2024 23:3672,754628,815,440602,859,000999,0002,277,376