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 listJan 13, 2025 12:42Alex KentAlex KentScore: 41,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 12:4241,301369,601,782340,800,0001,998,0002,383,872
2Jan 13, 2025 12:4241,309367,313,024340,864,0001,999,0002,392,064
3Jan 13, 2025 12:4241,322372,564,472340,974,0001,999,0002,482,176
4Jan 13, 2025 12:4241,324369,652,437340,991,0001,999,0002,387,968
5Jan 13, 2025 12:4241,326368,993,747341,002,0002,000,0002,387,968
6Jan 13, 2025 12:4241,327370,485,284342,018,0001,000,0002,506,752
7Jan 13, 2025 12:4241,329372,246,084342,033,0001,000,0002,523,136
8Jan 13, 2025 12:4241,333369,772,023342,067,0001,000,0002,387,968
9Jan 13, 2025 12:4241,337367,467,354342,096,0001,000,0002,387,968