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 15, 2024 00:37zielajzielajScore: 3,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 00:373,95857,118,56631,859,000995,0002,277,376
2Nov 15, 2024 00:373,96951,971,85331,946,000998,0002,359,296
3Nov 15, 2024 00:373,97059,270,61131,956,000998,0002,359,296
4Nov 15, 2024 00:373,98361,341,80232,060,0001,001,0002,367,488
5Nov 15, 2024 00:373,99654,882,56932,160,0001,005,0002,277,376
6Nov 15, 2024 00:374,02355,595,39231,369,0002,023,0002,265,088