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 01:57MatthiasMatthiasScore: 17,837Success
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 01:5717,812172,053,154145,846,0001,997,0002,289,664
2Nov 24, 2024 01:5717,829173,767,632145,985,0001,999,0002,265,088
3Nov 24, 2024 01:5717,833173,446,659146,011,0002,000,0002,289,664
4Nov 24, 2024 01:5717,833170,169,661146,014,0002,000,0002,289,664
5Nov 24, 2024 01:5717,837170,919,029146,047,0002,000,0002,289,664
6Nov 24, 2024 01:5717,842174,713,197146,087,0002,001,0002,269,184
7Nov 24, 2024 01:5717,850170,298,081146,156,0002,002,0002,383,872
8Nov 24, 2024 01:5717,854173,048,432146,189,0002,002,0002,289,664
9Nov 24, 2024 01:5717,877172,172,994147,381,0001,002,0002,265,088