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 17:35Rohan KapurRohan KapurScore: 60,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 18:2960,252522,422,286500,093,00002,367,488
2Jan 3, 2025 18:2960,271523,691,775500,249,00002,363,392
3Jan 3, 2025 18:2960,284527,421,843499,355,0001,000,0002,281,472
4Jan 3, 2025 18:2960,290528,230,616499,410,000998,0002,289,664
5Jan 3, 2025 18:2960,296529,141,339499,454,0001,000,0002,289,664
6Jan 3, 2025 18:2960,297525,570,760500,466,00002,379,776
7Jan 3, 2025 18:2960,316530,108,170499,624,000999,0002,371,584
8Jan 13, 2025 17:3560,317527,373,965499,635,000999,0002,379,776
9Jan 3, 2025 18:2960,331528,817,390498,750,0001,998,0002,375,680
10Jan 13, 2025 17:3560,337525,843,542499,800,000999,0002,289,664
11Jan 13, 2025 17:3560,365525,409,524499,028,0002,000,0002,289,664
12Jan 3, 2025 18:2960,509533,993,761498,212,0004,009,0002,375,680