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 24, 2024 02:31MatthiasMatthiasScore: 10,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2024 02:3110,336111,418,86684,791,000997,0002,285,568
2Nov 24, 2024 02:3110,341110,506,63085,829,00002,289,664
3Nov 24, 2024 02:3110,342111,706,70883,845,0001,996,0002,523,136
4Nov 24, 2024 02:3110,344114,953,31883,861,0001,996,0002,289,664
5Nov 24, 2024 02:3110,353109,370,95083,931,0001,998,0002,269,184
6Nov 24, 2024 02:3110,383107,697,88885,178,0001,002,0002,285,568