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 19:10olliecrowolliecrowScore: 6,334Success
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 19:106,12076,609,08546,810,0003,983,0002,289,664
2Feb 11, 2026 19:106,13480,104,28048,915,0001,996,0002,355,200
3Feb 11, 2026 19:106,19574,194,49249,403,0002,016,0002,322,432
4Feb 11, 2026 19:106,24077,329,45048,803,0002,987,0002,375,680
5Feb 11, 2026 19:106,24974,177,00347,875,0003,989,0002,486,272
6Feb 11, 2026 19:106,25781,921,64648,936,0002,996,0002,338,816
7Feb 11, 2026 19:106,33480,923,75849,600,0002,976,0002,473,984
8Feb 11, 2026 19:106,36076,619,40447,812,0004,980,0002,379,776
9Feb 11, 2026 19:106,42279,737,78149,282,0004,023,0002,326,528
10Feb 11, 2026 19:106,43283,470,37451,370,0002,014,0002,338,816
11Feb 11, 2026 19:106,52979,882,95151,177,0003,010,0002,412,544
12Feb 11, 2026 19:106,56479,284,51651,457,0003,026,0002,367,488