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 listApr 27, 2024 12:48Joad NacerJoad NacerScore: 14,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 12:4813,716172,724,751113,844,63302,281,472
2Apr 27, 2024 12:4813,777168,123,950114,351,63602,281,472
3Apr 27, 2024 12:4814,016175,031,756116,335,33602,277,376
4Apr 27, 2024 12:4814,206144,995,394115,908,0001,998,0002,285,568
5Apr 27, 2024 12:4814,212143,557,527115,963,0001,999,0002,285,568
6Apr 27, 2024 12:4814,214151,169,714116,978,000999,0002,285,568
7Apr 27, 2024 12:4814,216147,467,337115,992,0001,999,0002,510,848
8Apr 27, 2024 12:4814,218140,829,533116,007,0002,000,0002,355,200
9Apr 27, 2024 12:4814,222140,912,542116,044,0002,000,0002,531,328
10Apr 27, 2024 12:4814,229141,324,525116,098,0002,001,0002,269,184
11Apr 27, 2024 12:4814,270143,415,639116,430,0002,007,0002,285,568
12Apr 27, 2024 12:4815,480151,813,844127,483,0001,003,0002,519,040