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 11, 2026 20:46olliecrowolliecrowScore: 6,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 20:325,65273,583,59842,919,0003,992,0002,289,664
2Feb 11, 2026 20:465,66475,201,05045,010,0002,000,0002,428,928
3Feb 11, 2026 20:325,67177,834,98443,067,0004,006,0002,347,008
4Feb 11, 2026 20:465,67676,418,51745,104,0002,004,0002,314,240
5Feb 11, 2026 20:465,69078,446,98043,206,0004,019,0002,437,120
6Feb 11, 2026 20:325,76277,155,23643,842,0003,985,0002,416,640
7Feb 11, 2026 20:466,02480,352,33447,002,0003,000,0002,277,376
8Feb 11, 2026 20:326,03578,074,34247,083,0003,005,0002,469,888
9Feb 11, 2026 20:326,03674,851,26246,088,0004,007,0002,490,368
10Feb 11, 2026 20:466,05076,776,73445,195,0005,021,0002,400,256
11Feb 11, 2026 20:466,15276,906,81746,057,0005,006,0002,437,120
12Feb 11, 2026 20:326,17480,529,84847,224,0004,019,0002,482,176