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 listSep 28, 2026 07:17Karthik ReddyKarthik ReddyScore: 5,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 07:185,55357,892,49944,905,0001,190,0002,113,536
2Sep 28, 2026 07:185,58156,829,78945,146,0001,178,0002,113,536
3Sep 28, 2026 07:185,66357,604,25045,996,0001,013,0002,113,536
4Sep 28, 2026 07:185,66358,164,49345,813,0001,192,0002,113,536
5Sep 28, 2026 07:185,66657,569,29345,822,0001,211,0002,113,536
6Sep 28, 2026 07:185,66757,535,69945,827,0001,211,0002,113,536
7Sep 28, 2026 07:185,67357,618,35045,893,0001,197,0002,113,536
8Sep 28, 2026 07:185,68857,722,56946,202,0001,012,0002,113,536
9Sep 28, 2026 07:185,72458,240,29546,377,0001,140,0002,113,536