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 listJul 25, 2024 14:49matsuoka-601matsuoka-601Score: 13,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2024 14:4913,389199,652,643111,125,19102,289,664
2Jul 25, 2024 14:4913,390178,754,598111,137,77502,301,952
3Jul 25, 2024 14:4913,479137,822,261110,876,000998,0002,281,472
4Jul 25, 2024 14:4913,496137,636,418111,018,0001,000,0002,281,472
5Jul 25, 2024 14:4913,499135,054,466110,043,0002,000,0002,281,472
6Jul 25, 2024 14:4913,503137,601,643110,072,0002,001,0002,383,872
7Jul 25, 2024 14:4913,504136,055,842110,083,0002,001,0002,527,232
8Jul 25, 2024 14:4913,505135,633,566110,092,0002,001,0002,514,944
9Jul 25, 2024 14:4913,506145,901,055111,087,0001,009,0002,281,472
10Jul 25, 2024 14:4913,512136,893,695110,147,0002,002,0002,277,376
11Jul 25, 2024 14:4913,514136,166,589111,166,0001,001,0002,265,088
12Jul 25, 2024 14:4913,775173,714,813114,334,48202,289,664