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 18, 2026 19:08wnwnScore: 7,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:446,24276,784,77949,817,0001,992,0002,531,328
2Feb 18, 2026 18:446,25175,558,10548,889,0002,993,0002,506,752
3Feb 18, 2026 19:086,26772,043,93548,013,0004,001,0002,273,280
4Feb 18, 2026 19:086,26775,977,85051,019,0001,000,0002,510,848
5Feb 18, 2026 19:086,30273,985,30450,299,0002,011,0002,441,216
6Feb 18, 2026 18:446,36379,177,49950,818,0001,992,0002,277,376
7Feb 18, 2026 18:447,12878,210,91156,151,0003,008,0002,433,024
8Feb 18, 2026 18:447,16778,927,62557,467,0002,016,0002,387,968
9Feb 18, 2026 19:087,18885,685,94354,604,0005,055,0002,457,600
10Feb 18, 2026 18:447,27480,666,18759,371,0001,006,0002,449,408
11Feb 18, 2026 19:087,28289,169,76656,408,0004,029,0002,408,448
12Feb 18, 2026 19:087,31986,163,41558,754,0001,991,0002,478,080