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 listFeb 22, 2026 22:57wnwnScore: 4,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 22:574,35861,283,25534,166,0002,009,0002,494,464
2Feb 22, 2026 22:574,36960,945,28934,249,0002,014,0002,277,376
3Feb 22, 2026 22:574,37559,196,76135,304,0001,008,0002,486,272
4Feb 22, 2026 22:574,38558,222,99035,384,0001,010,0002,277,376
5Feb 22, 2026 22:574,39159,896,04635,431,0001,012,0002,277,376
6Feb 22, 2026 22:574,40358,449,13635,528,0001,015,0002,502,656
7Feb 22, 2026 23:004,43664,489,52834,831,0001,990,0002,535,424
8Feb 22, 2026 23:004,43961,088,52034,849,0001,991,0002,273,280
9Feb 22, 2026 22:574,44059,831,33434,857,0001,991,0002,494,464
10Feb 22, 2026 22:574,44059,910,40634,859,0001,991,0002,494,464
11Feb 22, 2026 23:004,44063,816,58934,859,0001,991,0002,494,464
12Feb 22, 2026 22:574,44167,616,86134,867,0001,992,0002,277,376