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 listJul 21, 2026 05:07Kevin HeaveyKevin HeaveyScore: 4,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 05:094,10043,622,26431,926,0002,111,0002,113,536
2Jul 21, 2026 05:094,10343,698,09631,956,0002,103,0002,113,536
3Jul 21, 2026 05:094,14044,014,34932,258,0002,106,0002,113,536
4Jul 21, 2026 05:094,14346,282,31731,376,0003,019,0002,113,536
5Jul 21, 2026 05:094,17044,366,67031,460,0003,158,0002,113,536
6Jul 21, 2026 05:094,18744,418,21831,475,0003,285,0002,113,536
7Jul 21, 2026 05:094,20644,519,29431,818,0003,093,0002,113,536
8Jul 21, 2026 05:094,32245,470,45133,772,0002,104,0002,113,536
9Jul 21, 2026 05:094,41946,917,86933,584,0003,096,0002,113,536