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 listJun 23, 2025 19:45Valentin KofmanValentin KofmanScore: 9,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 19:459,911103,052,76681,255,0001,003,0002,289,664
2Jun 23, 2025 19:459,938102,690,50882,488,00002,289,664
3Jun 23, 2025 19:459,946112,361,09981,548,0001,006,0002,289,664
4Jun 23, 2025 19:459,948110,012,83281,561,0001,006,0002,289,664
5Jun 23, 2025 19:459,952108,866,82181,593,0001,007,0002,269,184
6Jun 23, 2025 19:459,972107,792,78881,767,000997,0002,289,664
7Jun 23, 2025 19:459,973108,584,61081,778,000997,0002,289,664
8Jun 23, 2025 19:459,974108,907,54881,785,000997,0002,519,040
9Jun 23, 2025 19:459,975113,433,87281,799,000997,0002,289,664
10Jun 23, 2025 19:459,978112,431,47080,824,0001,995,0002,273,280
11Jun 23, 2025 19:459,979106,533,02380,829,0001,995,0002,269,184
12Jun 23, 2025 19:459,991106,748,82280,924,0001,998,0002,281,472