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 10, 2026 16:51Daniel MastalerzDaniel MastalerzScore: 9,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 16:519,617109,491,32570,842,0008,980,0002,457,600
2Feb 10, 2026 16:519,631108,014,71669,943,0009,991,0002,306,048
3Feb 10, 2026 16:519,633105,214,44070,960,0008,995,0002,519,040
4Feb 10, 2026 16:519,739101,733,02469,854,00010,977,0002,351,104
5Feb 10, 2026 16:519,765103,554,00673,043,0008,004,0002,355,200
6Feb 10, 2026 16:519,804104,948,94068,313,00013,059,0002,494,464