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 2, 2026 22:24Josu San MartinJosu San MartinScore: 5,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 22:245,36269,051,07243,491,0001,011,0002,289,664
2Jan 2, 2026 22:255,38073,538,78444,658,00002,367,488
3Jan 2, 2026 22:255,42374,224,05944,015,0001,000,0002,375,680
4Jan 2, 2026 22:245,47771,595,46043,440,0002,020,0002,293,760
5Jan 2, 2026 22:255,52470,932,35145,853,00002,363,392
6Jan 2, 2026 22:245,64481,933,28344,855,0001,993,0002,363,392
7Jan 2, 2026 22:255,69773,836,89846,279,0001,006,0002,355,200
8Jan 2, 2026 22:255,78974,921,81347,046,0001,000,0002,285,568
9Jan 2, 2026 22:255,86976,737,65948,716,00002,371,584
10Jan 2, 2026 22:245,88078,007,10547,811,000996,0002,367,488
11Jan 2, 2026 22:245,90477,618,09346,000,0003,000,0002,371,584
12Jan 2, 2026 22:245,97473,974,36048,572,0001,011,0002,465,792