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 listMar 13, 2026 00:23Benn TanBenn TanScore: 6,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 00:236,88081,839,59655,101,0002,003,0002,273,280
2Mar 13, 2026 00:236,88581,603,19955,138,0002,005,0002,273,280
3Mar 13, 2026 00:236,88581,314,77355,139,0002,005,0002,289,664
4Mar 13, 2026 00:236,88689,404,68655,146,0002,005,0002,277,376
5Mar 13, 2026 00:236,88781,362,22455,160,0002,005,0002,273,280
6Mar 13, 2026 00:236,88880,239,66755,166,0002,006,0002,289,664
7Mar 13, 2026 00:236,89880,462,66755,242,0002,008,0002,277,376
8Mar 13, 2026 00:236,89883,999,28155,245,0002,008,0002,281,472
9Mar 13, 2026 00:236,92480,043,84656,462,0001,008,0002,289,664
10Mar 13, 2026 00:239,463105,028,63277,537,0001,006,0002,269,184
11Mar 13, 2026 00:239,491109,049,46777,782,000997,0002,273,280
12Mar 13, 2026 00:239,495110,505,80676,812,0001,995,0002,289,664